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-165277024500457.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-S05J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277024500457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.9K Apr 30 03:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 03:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 03:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 03:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 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 92K 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 1652812268698

Running Version 202205111006
[2022-05-17 18:31:09] [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 18:31:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:31:09] [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 18:31:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:31:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2022-05-17 18:31:10] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 23 ms.
[2022-05-17 18:31:10] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 51 ms.
[2022-05-17 18:31:10] [INFO ] Unfolded 38 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:31:10] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-17 18:31:10] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-17 18:31:10] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 705 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 207 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-17 18:31:11] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2022-05-17 18:31:11] [INFO ] Computed 62 place invariants in 37 ms
[2022-05-17 18:31:11] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-17 18:31:11] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:31:12] [INFO ] After 357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:31:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:31:12] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:31:12] [INFO ] After 141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-17 18:31:12] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:31:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2022-05-17 18:31:12] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:31:13] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 18:31:13] [INFO ] After 168ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 18:31:13] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2022-05-17 18:31:13] [INFO ] After 995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 247 ms.
Support contains 11 out of 349 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 55 place count 319 transition count 530
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 55 place count 319 transition count 507
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 101 place count 296 transition count 507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 295 transition count 506
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 295 transition count 506
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 107 place count 293 transition count 504
Applied a total of 107 rules in 120 ms. Remains 293 /349 variables (removed 56) and now considering 504/555 (removed 51) transitions.
[2022-05-17 18:31:13] [INFO ] Flow matrix only has 500 transitions (discarded 4 similar events)
// Phase 1: matrix 500 rows 293 cols
[2022-05-17 18:31:13] [INFO ] Computed 57 place invariants in 18 ms
[2022-05-17 18:31:14] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 293/349 places, 409/555 transitions.
Applied a total of 0 rules in 18 ms. Remains 293 /293 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 293/349 places, 409/555 transitions.
Incomplete random walk after 1000000 steps, including 44106 resets, run finished after 2697 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6858 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:31:17] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
// Phase 1: matrix 405 rows 293 cols
[2022-05-17 18:31:17] [INFO ] Computed 57 place invariants in 15 ms
[2022-05-17 18:31:17] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:31:17] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:31:17] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:31:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:31:17] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:31:18] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:31:18] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:18] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 1 ms to minimize.
[2022-05-17 18:31:18] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:31:18] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:31:18] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
[2022-05-17 18:31:18] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:31:19] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 1 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:31:20] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:31:21] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:31:22] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:22] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:31:24] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:31:25] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 0 ms to minimize.
[2022-05-17 18:31:25] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:31:25] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:31:25] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:31:26] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:26] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:31:26] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:27] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:31:27] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:31:27] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2022-05-17 18:31:28] [INFO ] Deduced a trap composed of 109 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:31:28] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:31:29] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:31:29] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:31:31] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:31:32] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:33] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:34] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:31:36] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:31:36] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:31:38] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:31:40] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:31:41] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:31:47] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 7 ms to minimize.
[2022-05-17 18:31:53] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 12 ms to minimize.
[2022-05-17 18:31:53] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:31:54] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 45403 ms
[2022-05-17 18:32:03] [INFO ] After 45553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:32:03] [INFO ] After 45751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 293 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 293/293 places, 409/409 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 293 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 292 transition count 408
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 292 transition count 406
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 290 transition count 406
Applied a total of 6 rules in 23 ms. Remains 290 /293 variables (removed 3) and now considering 406/409 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/293 places, 406/409 transitions.
Incomplete random walk after 1000000 steps, including 52204 resets, run finished after 3318 ms. (steps per millisecond=301 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7060 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3944779 steps, run timeout after 12001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 3944779 steps, saw 1134235 distinct states, run finished after 12002 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:19] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:32:19] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-17 18:32:19] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:32:19] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:32:20] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:32:20] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:32:20] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:20] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 1 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 13 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:32:28] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:32:28] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:32:28] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:32:28] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:32:33] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:32:33] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2022-05-17 18:32:33] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:32:33] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:32:33] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:32:37] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 0 ms to minimize.
[2022-05-17 18:32:39] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:32:39] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2022-05-17 18:32:43] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:32:43] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:32:47] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:32:47] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:32:51] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:32:57] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:33:05] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:33:29] [INFO ] Trap strengthening (SAT) tested/added 69/69 trap constraints in 69536 ms
[2022-05-17 18:33:29] [INFO ] After 69604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:29] [INFO ] After 69815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-17 18:33:29] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:33:29] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-17 18:33:30] [INFO ] Implicit Places using invariants in 315 ms returned []
[2022-05-17 18:33:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:33:30] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-17 18:33:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:31] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2022-05-17 18:33:31] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-17 18:33:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:33:31] [INFO ] Computed 57 place invariants in 13 ms
[2022-05-17 18:33:31] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5210 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:33:31] [INFO ] Computed 57 place invariants in 13 ms
[2022-05-17 18:33:31] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:33:31] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:33:31] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:33:32] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:33:32] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:32] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 1 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2022-05-17 18:33:39] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:41] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:33:42] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:33:42] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:33:42] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:33:43] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:43] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:33:43] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:44] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:33:44] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:33:51] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:33:55] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2022-05-17 18:33:55] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:33:58] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:33:59] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:34:17] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:34:25] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:34:25] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Trap strengthening (SAT) tested/added 69/69 trap constraints in 69413 ms
[2022-05-17 18:34:41] [INFO ] After 69504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:34:41] [INFO ] After 69712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52235 resets, run finished after 3070 ms. (steps per millisecond=325 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7059 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2780705 steps, run timeout after 9001 ms. (steps per millisecond=308 ) properties seen :{}
Probabilistic random walk after 2780705 steps, saw 810511 distinct states, run finished after 9001 ms. (steps per millisecond=308 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:34:54] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:34:54] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-17 18:34:54] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:34:54] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:34:54] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:34:54] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:34:54] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:55] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 0 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 0 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:35:18] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:35:18] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:35:21] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:35:23] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2022-05-17 18:35:40] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:35:47] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:35:48] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:36:04] [INFO ] Trap strengthening (SAT) tested/added 69/69 trap constraints in 69327 ms
[2022-05-17 18:36:04] [INFO ] After 69379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:36:04] [INFO ] After 69592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-17 18:36:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:36:04] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-17 18:36:04] [INFO ] Implicit Places using invariants in 274 ms returned []
[2022-05-17 18:36:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:36:04] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-17 18:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:36:05] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2022-05-17 18:36:05] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 18:36:05] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:36:05] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-17 18:36:05] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5209 resets, run finished after 312 ms. (steps per millisecond=320 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:36:06] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:36:06] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-17 18:36:06] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:36:06] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:36:06] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:36:06] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:36:06] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:36:06] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:06] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:36:06] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:36:06] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:36:07] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:36:08] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:36:09] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:36:10] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:36:10] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:36:10] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:36:10] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:36:14] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2022-05-17 18:36:14] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2022-05-17 18:36:14] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:36:14] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:36:15] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:36:23] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:36:24] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:36:24] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:36:25] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:36:25] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:36:25] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:36:29] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:36:30] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:36:30] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2022-05-17 18:36:30] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:36:31] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2022-05-17 18:36:33] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:36:33] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:36:34] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:36:37] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 0 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:37:15] [INFO ] Trap strengthening (SAT) tested/added 69/69 trap constraints in 69139 ms
[2022-05-17 18:37:15] [INFO ] After 69191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:15] [INFO ] After 69390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 530 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 898775 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898775 steps, saw 279911 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:37:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:37:18] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-17 18:37:18] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:37:18] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 18:37:18] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:37:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:37:19] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:37:19] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:37:19] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:19] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:37:19] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:37:19] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:37:19] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:37:19] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:37:21] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 1 ms to minimize.
[2022-05-17 18:37:21] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:37:21] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:37:21] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 1 ms to minimize.
[2022-05-17 18:37:23] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:37:23] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2022-05-17 18:37:23] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:37:23] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:37:23] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:37:24] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:24] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:37:24] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:37:24] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:37:25] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:37:25] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:37:25] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:37:25] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:26] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:37:26] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:37:26] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:26] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:37:26] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:37:27] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:37:27] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:37:27] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:37:28] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:37:28] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:37:32] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 0 ms to minimize.
[2022-05-17 18:37:33] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:37:35] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:37:35] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:37:35] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:37:37] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:37:37] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:37:38] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:37:43] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:37:44] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:37:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:37:44] [INFO ] After 25061ms 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 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-17 18:37:44] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:37:44] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-17 18:37:44] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 10000 steps, including 524 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 885800 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :{}
Probabilistic random walk after 885800 steps, saw 277953 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:37:47] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:37:47] [INFO ] Computed 57 place invariants in 13 ms
[2022-05-17 18:37:47] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:37:47] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:37:47] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:37:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:37:47] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 18:37:47] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:37:47] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:37:47] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:37:48] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 0 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:37:49] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:37:50] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:37:50] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:37:52] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:37:53] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:37:54] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:37:55] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:37:56] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:37:57] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:37:57] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 24776 ms
[2022-05-17 18:38:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:38:12] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2022-05-17 18:38:12] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:38:12] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-17 18:38:12] [INFO ] Implicit Places using invariants in 331 ms returned []
[2022-05-17 18:38:12] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:38:12] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-17 18:38:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:38:13] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2022-05-17 18:38:13] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 18:38:13] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-17 18:38:13] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-17 18:38:14] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
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 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 32 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2022-05-17 18:38:14] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-17 18:38:14] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2022-05-17 18:38:14] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-17 18:38:14] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:38:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 18:38:14] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 18:38:14] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 0 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 0 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 1 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 1 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 0 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 0 ms to minimize.
[2022-05-17 18:38:22] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:38:23] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:38:23] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:38:23] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:38:23] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2022-05-17 18:38:24] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:38:25] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 6 ms to minimize.
[2022-05-17 18:38:25] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 1 ms to minimize.
[2022-05-17 18:38:25] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 1 ms to minimize.
[2022-05-17 18:38:25] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
[2022-05-17 18:38:25] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2022-05-17 18:38:26] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 0 ms to minimize.
[2022-05-17 18:38:26] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2022-05-17 18:38:35] [INFO ] Trap strengthening (SAT) tested/added 84/84 trap constraints in 20728 ms
[2022-05-17 18:38:35] [INFO ] After 20888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:35] [INFO ] After 20960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:35] [INFO ] Flatten gal took : 77 ms
[2022-05-17 18:38:35] [INFO ] Flatten gal took : 46 ms
[2022-05-17 18:38:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15284397224128342676.gal : 39 ms
[2022-05-17 18:38:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1322175532980338605.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17068893440028903796;'/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/ReachabilityCardinality15284397224128342676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1322175532980338605.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/ReachabilityCardinality1322175532980338605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35 after 62
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62 after 635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :635 after 794
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :794 after 1110
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1110 after 1721
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1721 after 28545
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28545 after 46567
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :46567 after 74829
Detected timeout of ITS tools.
[2022-05-17 18:38:50] [INFO ] Flatten gal took : 41 ms
[2022-05-17 18:38:50] [INFO ] Applying decomposition
[2022-05-17 18:38:50] [INFO ] Flatten gal took : 37 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/graph12284989653554704550.txt' '-o' '/tmp/graph12284989653554704550.bin' '-w' '/tmp/graph12284989653554704550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12284989653554704550.bin' '-l' '-1' '-v' '-w' '/tmp/graph12284989653554704550.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:38:50] [INFO ] Decomposing Gal with order
[2022-05-17 18:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:38:50] [INFO ] Removed a total of 498 redundant transitions.
[2022-05-17 18:38:51] [INFO ] Flatten gal took : 96 ms
[2022-05-17 18:38:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 14 ms.
[2022-05-17 18:38:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13111402510253091168.gal : 7 ms
[2022-05-17 18:38:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16461558760687697119.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17068893440028903796;'/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/ReachabilityCardinality13111402510253091168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16461558760687697119.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/ReachabilityCardinality16461558760687697119.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16746236757102683694
[2022-05-17 18:39:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16746236757102683694
Running compilation step : cd /tmp/ltsmin16746236757102683694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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 735 ms.
Running link step : cd /tmp/ltsmin16746236757102683694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16746236757102683694;'/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' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
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 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 42 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2022-05-17 18:39:21] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-17 18:39:21] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2022-05-17 18:39:21] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-17 18:39:21] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:39:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 18:39:21] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-17 18:39:21] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2022-05-17 18:39:21] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:22] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:23] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 1 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:24] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:39:25] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:39:26] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 0 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:39:27] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:28] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2022-05-17 18:39:29] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 0 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 0 ms to minimize.
[2022-05-17 18:39:30] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 0 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 1 ms to minimize.
[2022-05-17 18:39:31] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 0 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 1 ms to minimize.
[2022-05-17 18:39:32] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 0 ms to minimize.
[2022-05-17 18:39:41] [INFO ] Trap strengthening (SAT) tested/added 84/84 trap constraints in 20313 ms
[2022-05-17 18:39:41] [INFO ] After 20497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:39:41] [INFO ] After 20565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:39:41] [INFO ] Flatten gal took : 31 ms
[2022-05-17 18:39:41] [INFO ] Flatten gal took : 30 ms
[2022-05-17 18:39:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9851681914605874494.gal : 3 ms
[2022-05-17 18:39:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2110553944905302014.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/ReachabilityCardinality9851681914605874494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2110553944905302014.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/ReachabilityCardinality2110553944905302014.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35 after 62
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62 after 635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :635 after 794
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :794 after 1110
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1110 after 1721
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1721 after 28545
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28545 after 46567
Detected timeout of ITS tools.
[2022-05-17 18:39:57] [INFO ] Flatten gal took : 27 ms
[2022-05-17 18:39:57] [INFO ] Applying decomposition
[2022-05-17 18:39:57] [INFO ] Flatten gal took : 24 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/graph4373747639009671132.txt' '-o' '/tmp/graph4373747639009671132.bin' '-w' '/tmp/graph4373747639009671132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4373747639009671132.bin' '-l' '-1' '-v' '-w' '/tmp/graph4373747639009671132.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:39:57] [INFO ] Decomposing Gal with order
[2022-05-17 18:39:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:39:57] [INFO ] Removed a total of 434 redundant transitions.
[2022-05-17 18:39:57] [INFO ] Flatten gal took : 75 ms
[2022-05-17 18:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 197 labels/synchronizations in 10 ms.
[2022-05-17 18:39:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13891319072066754050.gal : 4 ms
[2022-05-17 18:39:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17990881227168169251.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/ReachabilityCardinality13891319072066754050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17990881227168169251.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/ReachabilityCardinality17990881227168169251.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10200635437557653886
[2022-05-17 18:40:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10200635437557653886
Running compilation step : cd /tmp/ltsmin10200635437557653886;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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 671 ms.
Running link step : cd /tmp/ltsmin10200635437557653886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10200635437557653886;'/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 18:40:27] [INFO ] Flatten gal took : 24 ms
[2022-05-17 18:40:27] [INFO ] Flatten gal took : 23 ms
[2022-05-17 18:40:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13110763443445013890.gal : 3 ms
[2022-05-17 18:40:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability169276817877633411.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/ReachabilityFireability13110763443445013890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability169276817877633411.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/ReachabilityFireability169276817877633411.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
Detected timeout of ITS tools.
[2022-05-17 18:40:30] [INFO ] Flatten gal took : 23 ms
[2022-05-17 18:40:30] [INFO ] Applying decomposition
[2022-05-17 18:40:30] [INFO ] Flatten gal took : 20 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/graph3877541642526835515.txt' '-o' '/tmp/graph3877541642526835515.bin' '-w' '/tmp/graph3877541642526835515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3877541642526835515.bin' '-l' '-1' '-v' '-w' '/tmp/graph3877541642526835515.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:40:30] [INFO ] Decomposing Gal with order
[2022-05-17 18:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:40:30] [INFO ] Removed a total of 364 redundant transitions.
[2022-05-17 18:40:30] [INFO ] Flatten gal took : 78 ms
[2022-05-17 18:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 11 ms.
[2022-05-17 18:40:30] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8688470662833795374.gal : 5 ms
[2022-05-17 18:40:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15057786815472377032.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/ReachabilityFireability8688470662833795374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15057786815472377032.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability15057786815472377032.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 80
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :97 after 261650
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :261650 after 261650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13776083889079177508
[2022-05-17 18:40:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13776083889079177508
Running compilation step : cd /tmp/ltsmin13776083889079177508;'/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'
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin13776083889079177508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13776083889079177508;'/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 18:40:36] [INFO ] Flatten gal took : 22 ms
[2022-05-17 18:40:36] [INFO ] Flatten gal took : 21 ms
[2022-05-17 18:40:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10114211188495518828.gal : 2 ms
[2022-05-17 18:40:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4706640130514640556.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/ReachabilityFireability10114211188495518828.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4706640130514640556.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/ReachabilityFireability4706640130514640556.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
Detected timeout of ITS tools.
[2022-05-17 18:41:06] [INFO ] Flatten gal took : 22 ms
[2022-05-17 18:41:06] [INFO ] Applying decomposition
[2022-05-17 18:41:06] [INFO ] Flatten gal took : 21 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/graph2631335659426422403.txt' '-o' '/tmp/graph2631335659426422403.bin' '-w' '/tmp/graph2631335659426422403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2631335659426422403.bin' '-l' '-1' '-v' '-w' '/tmp/graph2631335659426422403.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:41:06] [INFO ] Decomposing Gal with order
[2022-05-17 18:41:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:41:07] [INFO ] Removed a total of 364 redundant transitions.
[2022-05-17 18:41:07] [INFO ] Flatten gal took : 103 ms
[2022-05-17 18:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 11 ms.
[2022-05-17 18:41:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5574089177021074670.gal : 16 ms
[2022-05-17 18:41:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9324215768644852678.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/ReachabilityFireability5574089177021074670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9324215768644852678.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/ReachabilityFireability9324215768644852678.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 67
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :67 after 70
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :70 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 988700
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11702393245505514799
[2022-05-17 18:41:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11702393245505514799
Running compilation step : cd /tmp/ltsmin11702393245505514799;'/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 698 ms.
Running link step : cd /tmp/ltsmin11702393245505514799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11702393245505514799;'/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 18:42:07] [INFO ] Flatten gal took : 29 ms
[2022-05-17 18:42:07] [INFO ] Flatten gal took : 22 ms
[2022-05-17 18:42:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11000496588952662428.gal : 2 ms
[2022-05-17 18:42:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11926691931604059032.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/ReachabilityFireability11000496588952662428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11926691931604059032.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/ReachabilityFireability11926691931604059032.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :306848 after 982056
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :982056 after 6.61264e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.61264e+06 after 2.13807e+07
Detected timeout of ITS tools.
[2022-05-17 18:47:07] [INFO ] Flatten gal took : 31 ms
[2022-05-17 18:47:07] [INFO ] Applying decomposition
[2022-05-17 18:47:07] [INFO ] Flatten gal took : 17 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/graph666527543341985017.txt' '-o' '/tmp/graph666527543341985017.bin' '-w' '/tmp/graph666527543341985017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph666527543341985017.bin' '-l' '-1' '-v' '-w' '/tmp/graph666527543341985017.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:47:07] [INFO ] Decomposing Gal with order
[2022-05-17 18:47:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:47:07] [INFO ] Removed a total of 424 redundant transitions.
[2022-05-17 18:47:07] [INFO ] Flatten gal took : 86 ms
[2022-05-17 18:47:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 21 ms.
[2022-05-17 18:47:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7058090335583089228.gal : 5 ms
[2022-05-17 18:47:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1226409916941044732.prop : 10 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/ReachabilityFireability7058090335583089228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1226409916941044732.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/ReachabilityFireability1226409916941044732.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 83
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :83 after 90
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :90 after 91
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :91 after 92
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :92 after 94
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :94 after 105
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :105 after 109
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :109 after 157
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :157 after 428746
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :428746 after 1.1618e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.1618e+06 after 1.16728e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.16728e+06 after 2.39064e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.39064e+06 after 2.49566e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.49566e+06 after 2.03097e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.03097e+07 after 2.56191e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13443118158706865330
[2022-05-17 18:52:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13443118158706865330
Running compilation step : cd /tmp/ltsmin13443118158706865330;'/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 675 ms.
Running link step : cd /tmp/ltsmin13443118158706865330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13443118158706865330;'/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'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.015: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.013: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.016: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.017: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.017: State length is 290, there are 406 groups
pins2lts-mc-linux64( 0/ 8), 0.017: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.017: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.017: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.017: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.015: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.014: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 6.582: ~5 levels ~960 states ~1360 transitions
pins2lts-mc-linux64( 3/ 8), 6.693: ~2 levels ~1920 states ~10112 transitions
pins2lts-mc-linux64( 7/ 8), 6.783: ~4 levels ~3840 states ~19488 transitions
pins2lts-mc-linux64( 3/ 8), 6.914: ~4 levels ~7680 states ~25264 transitions
pins2lts-mc-linux64( 3/ 8), 7.173: ~4 levels ~15360 states ~43216 transitions
pins2lts-mc-linux64( 3/ 8), 7.584: ~6 levels ~30720 states ~65624 transitions
pins2lts-mc-linux64( 7/ 8), 8.062: ~9 levels ~61440 states ~143368 transitions
pins2lts-mc-linux64( 3/ 8), 9.336: ~11 levels ~122880 states ~299152 transitions
pins2lts-mc-linux64( 7/ 8), 10.805: ~17 levels ~245760 states ~587904 transitions
pins2lts-mc-linux64( 3/ 8), 14.908: ~34 levels ~491520 states ~1281456 transitions
pins2lts-mc-linux64( 3/ 8), 21.023: ~39 levels ~983040 states ~2323672 transitions
pins2lts-mc-linux64( 3/ 8), 29.198: ~76 levels ~1966080 states ~4152008 transitions
pins2lts-mc-linux64( 3/ 8), 42.339: ~95 levels ~3932160 states ~16679936 transitions
pins2lts-mc-linux64( 6/ 8), 66.293: ~29 levels ~7864320 states ~17794344 transitions
pins2lts-mc-linux64( 6/ 8), 115.540: ~46 levels ~15728640 states ~46226560 transitions
pins2lts-mc-linux64( 3/ 8), 206.398: ~99 levels ~31457280 states ~106982544 transitions
pins2lts-mc-linux64( 5/ 8), 226.646: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 226.792:
pins2lts-mc-linux64( 0/ 8), 226.792: mean standard work distribution: 15.4% (states) 45.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 226.792:
pins2lts-mc-linux64( 0/ 8), 226.792: Explored 29828788 states 116199998 transitions, fanout: 3.896
pins2lts-mc-linux64( 0/ 8), 226.792: Total exploration time 226.770 sec (226.630 sec minimum, 226.663 sec on average)
pins2lts-mc-linux64( 0/ 8), 226.792: States per second: 131538, Transitions per second: 512413
pins2lts-mc-linux64( 0/ 8), 226.792:
pins2lts-mc-linux64( 0/ 8), 226.792: Queue width: 8B, total height: 12147248, memory: 92.68MB
pins2lts-mc-linux64( 0/ 8), 226.792: Tree memory: 563.9MB, 14.7 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 226.792: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 226.792: Stored 409 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 226.792: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 226.792: Est. total memory use: 656.6MB (~1116.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13443118158706865330;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13443118158706865330;'/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'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 18:55:55] [INFO ] Flatten gal took : 19 ms
[2022-05-17 18:55:55] [INFO ] Flatten gal took : 17 ms
[2022-05-17 18:55:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13277864323662327468.gal : 2 ms
[2022-05-17 18:55:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1465712115087068397.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/ReachabilityFireability13277864323662327468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1465712115087068397.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/ReachabilityFireability1465712115087068397.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 72
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :72 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 185
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :185 after 334
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :334 after 600
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :600 after 1130
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1130 after 2553
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2553 after 16618
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16618 after 31829
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :31829 after 306848
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :306848 after 982056
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :982056 after 6.61264e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.61264e+06 after 2.13807e+07

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-S05J20"
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-S05J20, 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-165277024500457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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