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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 03:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 03:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 1652812288739

Running Version 202205111006
[2022-05-17 18:31:29] [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:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:31:30] [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:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:31:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 642 ms
[2022-05-17 18:31:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 22 ms.
[2022-05-17 18:31:30] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 52 ms.
[2022-05-17 18:31:30] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:31:30] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-17 18:31:30] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-17 18:31:30] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 704 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2022-05-17 18:31:31] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2022-05-17 18:31:31] [INFO ] Computed 82 place invariants in 70 ms
[2022-05-17 18:31:31] [INFO ] [Real]Absence check using 75 positive place invariants in 29 ms returned sat
[2022-05-17 18:31:31] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:31:31] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:31:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2022-05-17 18:31:32] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-17 18:31:32] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:31:39] [INFO ] After 6668ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:39] [INFO ] After 6739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-17 18:31:39] [INFO ] After 7462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
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 153 place count 410 transition count 671
Applied a total of 153 rules in 148 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
[2022-05-17 18:31:39] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2022-05-17 18:31:39] [INFO ] Computed 77 place invariants in 29 ms
[2022-05-17 18:31:40] [INFO ] Dead Transitions using invariants and state equation in 621 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 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 40 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/489 places, 576/745 transitions.
Incomplete random walk after 1000000 steps, including 52087 resets, run finished after 3703 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5694 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2929798 steps, run timeout after 12001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 2929798 steps, saw 856274 distinct states, run finished after 12002 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:31:56] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:31:56] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-17 18:31:57] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2022-05-17 18:31:57] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-17 18:31:57] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:31:57] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2022-05-17 18:31:57] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 18:31:57] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:31:57] [INFO ] After 153ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:57] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2022-05-17 18:31:57] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:31:57] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 2 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2022-05-17 18:31:58] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:31:59] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:31:59] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:31:59] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 0 ms to minimize.
[2022-05-17 18:31:59] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 1 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 0 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2022-05-17 18:32:00] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:32:01] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:02] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:02] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:02] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:02] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:03] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:32:04] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:04] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:32:04] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:04] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:32:05] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:05] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:32:05] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:32:05] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:32:05] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:14] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17468 ms
[2022-05-17 18:32:15] [INFO ] After 17700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:32:15] [INFO ] After 18007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-17 18:32:15] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:32:15] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-17 18:32:15] [INFO ] Implicit Places using invariants in 446 ms returned []
[2022-05-17 18:32:15] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:32:15] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:32:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:16] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2022-05-17 18:32:17] [INFO ] Redundant transitions in 43 ms returned []
[2022-05-17 18:32:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:32:17] [INFO ] Computed 77 place invariants in 15 ms
[2022-05-17 18:32:17] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5199 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:32:17] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-17 18:32:17] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-17 18:32:18] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:32:18] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2022-05-17 18:32:18] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:32:18] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:18] [INFO ] After 141ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:18] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:32:18] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:18] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 0 ms to minimize.
[2022-05-17 18:32:18] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:19] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:20] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:32:21] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 2 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 2 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 137 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:32:25] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:32:25] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:32:25] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2022-05-17 18:32:25] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:35] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17297 ms
[2022-05-17 18:32:35] [INFO ] After 17482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:32:35] [INFO ] After 17720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51826 resets, run finished after 3596 ms. (steps per millisecond=278 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5555 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2960705 steps, run timeout after 12001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 2960705 steps, saw 865175 distinct states, run finished after 12001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:52] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:32:52] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-17 18:32:52] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-17 18:32:52] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:32:52] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:52] [INFO ] [Nat]Absence check using 70 positive place invariants in 22 ms returned sat
[2022-05-17 18:32:52] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:32:52] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:52] [INFO ] After 138ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:52] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:32:54] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2022-05-17 18:32:55] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:32:56] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-05-17 18:32:57] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:57] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:57] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:32:57] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:32:58] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:32:59] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:32:59] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:32:59] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:32:59] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:33:00] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:33:00] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:33:00] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:00] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 0 ms to minimize.
[2022-05-17 18:33:00] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:33:09] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17173 ms
[2022-05-17 18:33:09] [INFO ] After 17370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:10] [INFO ] After 17628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-17 18:33:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:10] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-17 18:33:10] [INFO ] Implicit Places using invariants in 394 ms returned []
[2022-05-17 18:33:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:10] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-17 18:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:11] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
[2022-05-17 18:33:11] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 18:33:11] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:11] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-17 18:33:11] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5206 resets, run finished after 366 ms. (steps per millisecond=273 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:12] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-17 18:33:12] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2022-05-17 18:33:12] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:33:12] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-17 18:33:12] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:33:12] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:12] [INFO ] After 138ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:12] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:13] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:33:14] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:33:14] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:14] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:33:14] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:14] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:15] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 3 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:33:16] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:17] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:33:17] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:33:17] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:33:17] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:18] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:18] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:18] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:18] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:33:18] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 0 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:33:29] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17140 ms
[2022-05-17 18:33:30] [INFO ] After 17328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:30] [INFO ] After 17589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 492 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665756 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665756 steps, saw 205241 distinct states, run finished after 3003 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:33] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:33] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-17 18:33:33] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2022-05-17 18:33:33] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:33:33] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:33] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2022-05-17 18:33:33] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:33:33] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:33] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 0 ms to minimize.
[2022-05-17 18:33:36] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:33:37] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:33:37] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:33:37] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:33:37] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:33:38] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:38] [INFO ] Deduced a trap composed of 138 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:33:38] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:38] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 0 ms to minimize.
[2022-05-17 18:33:38] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:33:39] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:33:39] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:33:39] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:33:39] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:33:40] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:33:41] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:33:42] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:33:43] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:33:58] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24617 ms
[2022-05-17 18:33:58] [INFO ] After 24741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:58] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-17 18:33:58] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:33:58] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:33:58] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 509 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 672344 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 672344 steps, saw 207241 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:34:01] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:34:01] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-17 18:34:01] [INFO ] [Real]Absence check using 70 positive place invariants in 19 ms returned sat
[2022-05-17 18:34:01] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:34:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:01] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2022-05-17 18:34:01] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-17 18:34:01] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:02] [INFO ] After 110ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 13 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 0 ms to minimize.
[2022-05-17 18:34:17] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:18] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 1 ms to minimize.
[2022-05-17 18:34:26] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24614 ms
[2022-05-17 18:34:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 18:34:26] [INFO ] After 25012ms 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 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-17 18:34:26] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:34:26] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:34:27] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-17 18:34:27] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:34:27] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:34:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:28] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2022-05-17 18:34:28] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 18:34:28] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-17 18:34:28] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:34:28] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 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 410 transition count 572
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 410 transition count 571
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 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 46 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2022-05-17 18:34:28] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-17 18:34:28] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-17 18:34:28] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-17 18:34:28] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:28] [INFO ] [Nat]Absence check using 70 positive place invariants in 27 ms returned sat
[2022-05-17 18:34:28] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:34:29] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 1 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2022-05-17 18:34:30] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 0 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:34:31] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 1 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2022-05-17 18:34:32] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 0 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:33] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:43] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:34:47] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:34:48] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:48] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:34:50] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 1 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:35:16] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:35:28] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:35:35] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:35:36] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 0 ms to minimize.
[2022-05-17 18:35:41] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:35:45] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:35:46] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 86762 ms
[2022-05-17 18:35:55] [INFO ] After 86961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:55] [INFO ] After 87054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:56] [INFO ] Flatten gal took : 132 ms
[2022-05-17 18:35:56] [INFO ] Flatten gal took : 72 ms
[2022-05-17 18:35:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12766911353789243524.gal : 45 ms
[2022-05-17 18:35:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7832036258004842569.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13898376143644414594;'/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/ReachabilityCardinality12766911353789243524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7832036258004842569.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/ReachabilityCardinality7832036258004842569.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 45
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45 after 59
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59 after 1318
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1318 after 1437
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 1972
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1972 after 2879
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2879 after 4151
Detected timeout of ITS tools.
[2022-05-17 18:36:11] [INFO ] Flatten gal took : 52 ms
[2022-05-17 18:36:11] [INFO ] Applying decomposition
[2022-05-17 18:36:11] [INFO ] Flatten gal took : 46 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/graph18331541181157027581.txt' '-o' '/tmp/graph18331541181157027581.bin' '-w' '/tmp/graph18331541181157027581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18331541181157027581.bin' '-l' '-1' '-v' '-w' '/tmp/graph18331541181157027581.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:36:11] [INFO ] Decomposing Gal with order
[2022-05-17 18:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:36:11] [INFO ] Removed a total of 536 redundant transitions.
[2022-05-17 18:36:11] [INFO ] Flatten gal took : 259 ms
[2022-05-17 18:36:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 38 ms.
[2022-05-17 18:36:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9210904920735025144.gal : 21 ms
[2022-05-17 18:36:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8288096850031258347.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13898376143644414594;'/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/ReachabilityCardinality9210904920735025144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8288096850031258347.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/ReachabilityCardinality8288096850031258347.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6300003293536596703
[2022-05-17 18:36:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6300003293536596703
Running compilation step : cd /tmp/ltsmin6300003293536596703;'/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 1036 ms.
Running link step : cd /tmp/ltsmin6300003293536596703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6300003293536596703;'/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 410 transition count 572
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 410 transition count 571
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 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 48 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2022-05-17 18:36:42] [INFO ] Computed 77 place invariants in 16 ms
[2022-05-17 18:36:42] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2022-05-17 18:36:42] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:36:42] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:42] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2022-05-17 18:36:42] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 16 ms returned sat
[2022-05-17 18:36:42] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 3 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 117 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 1 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 0 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 144 places in 110 ms of which 1 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 0 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 0 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 1 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 0 ms to minimize.
[2022-05-17 18:37:05] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 0 ms to minimize.
[2022-05-17 18:37:10] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 1 ms to minimize.
[2022-05-17 18:37:11] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2022-05-17 18:37:13] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2022-05-17 18:37:13] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2022-05-17 18:37:13] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 0 ms to minimize.
[2022-05-17 18:37:14] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 1 ms to minimize.
[2022-05-17 18:37:14] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 1 ms to minimize.
[2022-05-17 18:37:18] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2022-05-17 18:37:20] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 0 ms to minimize.
[2022-05-17 18:37:24] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 0 ms to minimize.
[2022-05-17 18:37:29] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:37:31] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 0 ms to minimize.
[2022-05-17 18:37:38] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 0 ms to minimize.
[2022-05-17 18:37:43] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:37:50] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 1 ms to minimize.
[2022-05-17 18:37:51] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2022-05-17 18:37:57] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 1 ms to minimize.
[2022-05-17 18:38:02] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2022-05-17 18:38:11] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 88804 ms
[2022-05-17 18:38:11] [INFO ] After 89013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:11] [INFO ] After 89104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:11] [INFO ] Flatten gal took : 37 ms
[2022-05-17 18:38:11] [INFO ] Flatten gal took : 33 ms
[2022-05-17 18:38:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12002043582255070353.gal : 4 ms
[2022-05-17 18:38:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7979542202894958102.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/ReachabilityCardinality12002043582255070353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7979542202894958102.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/ReachabilityCardinality7979542202894958102.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 45
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45 after 59
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59 after 1318
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1318 after 1437
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 1972
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1972 after 2879
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2879 after 4151
Detected timeout of ITS tools.
[2022-05-17 18:38:26] [INFO ] Flatten gal took : 32 ms
[2022-05-17 18:38:26] [INFO ] Applying decomposition
[2022-05-17 18:38:26] [INFO ] Flatten gal took : 31 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/graph17762152857425500857.txt' '-o' '/tmp/graph17762152857425500857.bin' '-w' '/tmp/graph17762152857425500857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17762152857425500857.bin' '-l' '-1' '-v' '-w' '/tmp/graph17762152857425500857.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:38:26] [INFO ] Decomposing Gal with order
[2022-05-17 18:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:38:26] [INFO ] Removed a total of 626 redundant transitions.
[2022-05-17 18:38:26] [INFO ] Flatten gal took : 85 ms
[2022-05-17 18:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 29 ms.
[2022-05-17 18:38:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14144037509337755603.gal : 37 ms
[2022-05-17 18:38:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3391869268560696573.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/ReachabilityCardinality14144037509337755603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3391869268560696573.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/ReachabilityCardinality3391869268560696573.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 227
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :227 after 229
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :229 after 2429
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2429 after 2437
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2437 after 2485
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2485 after 2493
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2493 after 2509
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2509 after 2599
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2599 after 2789
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2789 after 4809
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4809 after 5797
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5797 after 8509
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8509 after 23896
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :23896 after 297338
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1328935918693550525
[2022-05-17 18:38:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1328935918693550525
Running compilation step : cd /tmp/ltsmin1328935918693550525;'/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 946 ms.
Running link step : cd /tmp/ltsmin1328935918693550525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1328935918693550525;'/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:38:57] [INFO ] Flatten gal took : 28 ms
[2022-05-17 18:38:57] [INFO ] Flatten gal took : 26 ms
[2022-05-17 18:38:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14040793426854306303.gal : 4 ms
[2022-05-17 18:38:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17168828525320258359.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/ReachabilityFireability14040793426854306303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17168828525320258359.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/ReachabilityFireability17168828525320258359.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 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 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 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
Detected timeout of ITS tools.
[2022-05-17 18:39:00] [INFO ] Flatten gal took : 26 ms
[2022-05-17 18:39:00] [INFO ] Applying decomposition
[2022-05-17 18:39:00] [INFO ] Flatten gal took : 28 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/graph12879795709805097752.txt' '-o' '/tmp/graph12879795709805097752.bin' '-w' '/tmp/graph12879795709805097752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12879795709805097752.bin' '-l' '-1' '-v' '-w' '/tmp/graph12879795709805097752.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:39:00] [INFO ] Decomposing Gal with order
[2022-05-17 18:39:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:39:00] [INFO ] Removed a total of 544 redundant transitions.
[2022-05-17 18:39:00] [INFO ] Flatten gal took : 75 ms
[2022-05-17 18:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 16 ms.
[2022-05-17 18:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14379416926314465494.gal : 6 ms
[2022-05-17 18:39:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11626771728814542725.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/ReachabilityFireability14379416926314465494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11626771728814542725.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/ReachabilityFireability11626771728814542725.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 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 103
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :103 after 146
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :146 after 245
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :245 after 814825
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :814825 after 814825
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6870716555295550939
[2022-05-17 18:39:03] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6870716555295550939
Running compilation step : cd /tmp/ltsmin6870716555295550939;'/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 949 ms.
Running link step : cd /tmp/ltsmin6870716555295550939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6870716555295550939;'/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:39:06] [INFO ] Flatten gal took : 26 ms
[2022-05-17 18:39:06] [INFO ] Flatten gal took : 26 ms
[2022-05-17 18:39:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7521883493541663177.gal : 4 ms
[2022-05-17 18:39:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14614300213560905504.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/ReachabilityFireability7521883493541663177.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14614300213560905504.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/ReachabilityFireability14614300213560905504.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 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 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 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
Detected timeout of ITS tools.
[2022-05-17 18:39:36] [INFO ] Flatten gal took : 31 ms
[2022-05-17 18:39:36] [INFO ] Applying decomposition
[2022-05-17 18:39:36] [INFO ] Flatten gal took : 27 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/graph16579041948452466512.txt' '-o' '/tmp/graph16579041948452466512.bin' '-w' '/tmp/graph16579041948452466512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16579041948452466512.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579041948452466512.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:39:36] [INFO ] Decomposing Gal with order
[2022-05-17 18:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:39:36] [INFO ] Removed a total of 787 redundant transitions.
[2022-05-17 18:39:36] [INFO ] Flatten gal took : 59 ms
[2022-05-17 18:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 9 ms.
[2022-05-17 18:39:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability161401246634672949.gal : 8 ms
[2022-05-17 18:39:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16186465298595483784.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/ReachabilityFireability161401246634672949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16186465298595483784.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/ReachabilityFireability16186465298595483784.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 249
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :249 after 268
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :268 after 274
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :274 after 274
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :274 after 330
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :330 after 636
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :636 after 1036
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1036 after 1914
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1914 after 2446
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2446 after 31598
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :31598 after 115917
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18319395646611593577
[2022-05-17 18:40:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18319395646611593577
Running compilation step : cd /tmp/ltsmin18319395646611593577;'/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 988 ms.
Running link step : cd /tmp/ltsmin18319395646611593577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18319395646611593577;'/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:37] [INFO ] Flatten gal took : 27 ms
[2022-05-17 18:40:37] [INFO ] Flatten gal took : 24 ms
[2022-05-17 18:40:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13752686825673581674.gal : 5 ms
[2022-05-17 18:40:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9783839772156178371.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/ReachabilityFireability13752686825673581674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9783839772156178371.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/ReachabilityFireability9783839772156178371.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 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 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 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :95398 after 329502
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :329502 after 2.66494e+06
Detected timeout of ITS tools.
[2022-05-17 18:45:37] [INFO ] Flatten gal took : 23 ms
[2022-05-17 18:45:37] [INFO ] Applying decomposition
[2022-05-17 18:45:37] [INFO ] Flatten gal took : 22 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/graph16195214425012719726.txt' '-o' '/tmp/graph16195214425012719726.bin' '-w' '/tmp/graph16195214425012719726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16195214425012719726.bin' '-l' '-1' '-v' '-w' '/tmp/graph16195214425012719726.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:45:37] [INFO ] Decomposing Gal with order
[2022-05-17 18:45:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:45:37] [INFO ] Removed a total of 544 redundant transitions.
[2022-05-17 18:45:37] [INFO ] Flatten gal took : 73 ms
[2022-05-17 18:45:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 26 ms.
[2022-05-17 18:45:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6875144298129689453.gal : 15 ms
[2022-05-17 18:45:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17223438696376603456.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/ReachabilityFireability6875144298129689453.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17223438696376603456.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/ReachabilityFireability17223438696376603456.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 223
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :223 after 2135
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2135 after 23646
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23646 after 31006
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11681960707812238007
[2022-05-17 18:50:38] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11681960707812238007
Running compilation step : cd /tmp/ltsmin11681960707812238007;'/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 1046 ms.
Running link step : cd /tmp/ltsmin11681960707812238007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11681960707812238007;'/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( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: 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.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.031: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.032: There are 577 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.032: State length is 410, there are 576 groups
pins2lts-mc-linux64( 0/ 8), 0.032: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.032: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.032: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.032: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.016: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.017: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.017: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.017: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.018: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.018: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 16.187: ~6 levels ~960 states ~2616 transitions
pins2lts-mc-linux64( 0/ 8), 16.262: ~7 levels ~1920 states ~3576 transitions
pins2lts-mc-linux64( 0/ 8), 16.423: ~8 levels ~3840 states ~5496 transitions
pins2lts-mc-linux64( 7/ 8), 16.691: ~4 levels ~7680 states ~43704 transitions
pins2lts-mc-linux64( 7/ 8), 17.018: ~5 levels ~15360 states ~66488 transitions
pins2lts-mc-linux64( 7/ 8), 17.554: ~6 levels ~30720 states ~111368 transitions
pins2lts-mc-linux64( 7/ 8), 18.302: ~7 levels ~61440 states ~172984 transitions
pins2lts-mc-linux64( 7/ 8), 23.747: ~10 levels ~122880 states ~241960 transitions
pins2lts-mc-linux64( 1/ 8), 26.545: ~9 levels ~245760 states ~483840 transitions
pins2lts-mc-linux64( 7/ 8), 31.896: ~16 levels ~491520 states ~1163144 transitions
pins2lts-mc-linux64( 1/ 8), 42.254: ~15 levels ~983040 states ~2309344 transitions
pins2lts-mc-linux64( 1/ 8), 55.255: ~28 levels ~1966080 states ~4353752 transitions
pins2lts-mc-linux64( 1/ 8), 74.789: ~65 levels ~3932160 states ~12656568 transitions
pins2lts-mc-linux64( 1/ 8), 117.298: ~67 levels ~7864320 states ~35225040 transitions
pins2lts-mc-linux64( 6/ 8), 170.861: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 171.104:
pins2lts-mc-linux64( 0/ 8), 171.104: mean standard work distribution: 19.9% (states) 50.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 171.104:
pins2lts-mc-linux64( 0/ 8), 171.104: Explored 9423653 states 83619319 transitions, fanout: 8.873
pins2lts-mc-linux64( 0/ 8), 171.104: Total exploration time 171.060 sec (170.840 sec minimum, 170.885 sec on average)
pins2lts-mc-linux64( 0/ 8), 171.104: States per second: 55090, Transitions per second: 488830
pins2lts-mc-linux64( 0/ 8), 171.104:
pins2lts-mc-linux64( 0/ 8), 171.104: Queue width: 8B, total height: 18463652, memory: 140.87MB
pins2lts-mc-linux64( 0/ 8), 171.104: Tree memory: 467.5MB, 17.7 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 171.104: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 171.104: Stored 583 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 171.104: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 171.104: Est. total memory use: 608.3MB (~1164.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11681960707812238007;'/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/ltsmin11681960707812238007;'/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:53:30] [INFO ] Flatten gal took : 24 ms
[2022-05-17 18:53:30] [INFO ] Flatten gal took : 21 ms
[2022-05-17 18:53:30] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11814511209254375182.gal : 4 ms
[2022-05-17 18:53:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability400967967642312183.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/ReachabilityFireability11814511209254375182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability400967967642312183.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/ReachabilityFireability400967967642312183.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 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 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 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :95398 after 329502
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :329502 after 2.66494e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.66494e+06 after 5.10811e+06

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

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