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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 03:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K 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 93K 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 1652812311752

Running Version 202205111006
[2022-05-17 18:31:52] [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:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:31:52] [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:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:31:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2022-05-17 18:31:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 21 ms.
[2022-05-17 18:31:53] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 52 ms.
[2022-05-17 18:31:53] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:31:53] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-17 18:31:53] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-17 18:31:53] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 692 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2022-05-17 18:31:54] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2022-05-17 18:31:54] [INFO ] Computed 102 place invariants in 59 ms
[2022-05-17 18:31:54] [INFO ] [Real]Absence check using 95 positive place invariants in 32 ms returned sat
[2022-05-17 18:31:54] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2022-05-17 18:31:54] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:31:55] [INFO ] [Nat]Absence check using 95 positive place invariants in 32 ms returned sat
[2022-05-17 18:31:55] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 18:31:55] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:31:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:00] [INFO ] After 4707ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:00] [INFO ] After 4785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-17 18:32:00] [INFO ] After 5705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
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 193 place count 530 transition count 841
Applied a total of 193 rules in 187 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2022-05-17 18:32:00] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2022-05-17 18:32:00] [INFO ] Computed 97 place invariants in 54 ms
[2022-05-17 18:32:01] [INFO ] Dead Transitions using invariants and state equation in 544 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 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 38 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/629 places, 746/935 transitions.
Incomplete random walk after 1000000 steps, including 52005 resets, run finished after 4072 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4654 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3093287 steps, run timeout after 15001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 3093287 steps, saw 925397 distinct states, run finished after 15002 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:21] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:32:21] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-17 18:32:21] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-17 18:32:21] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-17 18:32:21] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:21] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-17 18:32:21] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-17 18:32:21] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:22] [INFO ] After 165ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 180 places in 181 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:32:22] [INFO ] Deduced a trap composed of 179 places in 171 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 167 places in 163 ms of which 0 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 182 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:32:23] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 0 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 1 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 0 ms to minimize.
[2022-05-17 18:32:24] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 0 ms to minimize.
[2022-05-17 18:32:25] [INFO ] Deduced a trap composed of 176 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 162 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:32:26] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 0 ms to minimize.
[2022-05-17 18:32:27] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:32:27] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:32:27] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:28] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:32:29] [INFO ] Deduced a trap composed of 173 places in 151 ms of which 0 ms to minimize.
[2022-05-17 18:32:30] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:32:30] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:30] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:30] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:32:31] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:32:40] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18364 ms
[2022-05-17 18:32:40] [INFO ] After 18604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:32:40] [INFO ] After 18935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 20 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-17 18:32:40] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:32:40] [INFO ] Computed 97 place invariants in 23 ms
[2022-05-17 18:32:41] [INFO ] Implicit Places using invariants in 475 ms returned []
[2022-05-17 18:32:41] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:32:41] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-17 18:32:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:42] [INFO ] Implicit Places using invariants and state equation in 1800 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2022-05-17 18:32:42] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-17 18:32:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:32:42] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-17 18:32:43] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5227 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:32:43] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-17 18:32:44] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-17 18:32:44] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:32:44] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:44] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-17 18:32:44] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-17 18:32:44] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:44] [INFO ] After 159ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 180 places in 159 ms of which 0 ms to minimize.
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 1 ms to minimize.
[2022-05-17 18:32:45] [INFO ] Deduced a trap composed of 179 places in 159 ms of which 0 ms to minimize.
[2022-05-17 18:32:45] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:32:45] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:32:45] [INFO ] Deduced a trap composed of 182 places in 154 ms of which 0 ms to minimize.
[2022-05-17 18:32:45] [INFO ] Deduced a trap composed of 176 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:46] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2022-05-17 18:32:46] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:32:46] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:32:46] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:32:46] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:32:47] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 176 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:32:48] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:32:49] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:32:49] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:49] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 0 ms to minimize.
[2022-05-17 18:32:50] [INFO ] Deduced a trap composed of 146 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:32:51] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:32:52] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:32:52] [INFO ] Deduced a trap composed of 173 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:32:52] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Deduced a trap composed of 167 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:33:02] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18160 ms
[2022-05-17 18:33:02] [INFO ] After 18378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:02] [INFO ] After 18704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52019 resets, run finished after 4117 ms. (steps per millisecond=242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4559 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3127230 steps, run timeout after 15001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 3127230 steps, saw 934088 distinct states, run finished after 15003 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:22] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:33:22] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-17 18:33:23] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-17 18:33:23] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-17 18:33:23] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:23] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:33:23] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-17 18:33:23] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:23] [INFO ] After 154ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 0 ms to minimize.
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 176 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 3 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 167 places in 153 ms of which 2 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 179 places in 156 ms of which 5 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:26] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:33:28] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:33:28] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:33:28] [INFO ] Deduced a trap composed of 179 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:33:29] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:33:30] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2022-05-17 18:33:31] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:33:31] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:33:31] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2022-05-17 18:33:41] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18201 ms
[2022-05-17 18:33:41] [INFO ] After 18412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:41] [INFO ] After 18726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 29 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 29 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-17 18:33:41] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:33:41] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-17 18:33:42] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-05-17 18:33:42] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:33:42] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-17 18:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:43] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2022-05-17 18:33:43] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-17 18:33:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:33:43] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-17 18:33:44] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 100000 steps, including 5159 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:44] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:33:44] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-17 18:33:44] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2022-05-17 18:33:44] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-17 18:33:44] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:44] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:33:44] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2022-05-17 18:33:45] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:45] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 0 ms to minimize.
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 0 ms to minimize.
[2022-05-17 18:33:45] [INFO ] Deduced a trap composed of 179 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Deduced a trap composed of 182 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:33:47] [INFO ] Deduced a trap composed of 167 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:33:47] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2022-05-17 18:33:47] [INFO ] Deduced a trap composed of 179 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:33:47] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:47] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:33:48] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:33:49] [INFO ] Deduced a trap composed of 155 places in 136 ms of which 1 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 179 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:33:50] [INFO ] Deduced a trap composed of 146 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:33:52] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:33:52] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:33:53] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:33:53] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:33:53] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:33:54] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 18101 ms
[2022-05-17 18:34:03] [INFO ] After 18337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:34:03] [INFO ] After 18649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 512 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 565164 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565164 steps, saw 170094 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:34:06] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:06] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-17 18:34:06] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2022-05-17 18:34:06] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:34:06] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:06] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:34:06] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 17 ms returned sat
[2022-05-17 18:34:06] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:07] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 176 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 173 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 155 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 0 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:34:11] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 173 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:34:13] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 176 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:34:14] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:15] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:34:16] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:16] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:16] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:34:18] [INFO ] Deduced a trap composed of 176 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:18] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:34:19] [INFO ] Deduced a trap composed of 176 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:34:19] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:34:20] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:34:20] [INFO ] Deduced a trap composed of 182 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:34:29] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 22560 ms
[2022-05-17 18:34:29] [INFO ] After 22816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:34:29] [INFO ] After 23113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 19 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-17 18:34:29] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:29] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-17 18:34:30] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Incomplete random walk after 10000 steps, including 534 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 574062 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574062 steps, saw 173009 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:34:33] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:33] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-17 18:34:33] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:34:33] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-17 18:34:33] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:33] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:34:33] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 20 ms returned sat
[2022-05-17 18:34:33] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:33] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 176 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:34:34] [INFO ] Deduced a trap composed of 185 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 170 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:34:35] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 152 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:36] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:37] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 179 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:34:38] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 158 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:34:39] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:40] [INFO ] Deduced a trap composed of 179 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Deduced a trap composed of 164 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Deduced a trap composed of 176 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:34:41] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 2 ms to minimize.
[2022-05-17 18:34:42] [INFO ] Deduced a trap composed of 167 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:43] [INFO ] Deduced a trap composed of 161 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:34:43] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:34:45] [INFO ] Deduced a trap composed of 176 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:34:45] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:34:45] [INFO ] Deduced a trap composed of 176 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:34:46] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:34:46] [INFO ] Deduced a trap composed of 167 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:34:47] [INFO ] Deduced a trap composed of 182 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 22529 ms
[2022-05-17 18:34:56] [INFO ] After 22788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:34:56] [INFO ] After 23113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-17 18:34:56] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:56] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-17 18:34:57] [INFO ] Implicit Places using invariants in 464 ms returned []
[2022-05-17 18:34:57] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:57] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-17 18:34:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:59] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
[2022-05-17 18:34:59] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 18:34:59] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-17 18:34:59] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-17 18:34:59] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 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 530 transition count 742
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 530 transition count 741
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 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 63 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2022-05-17 18:34:59] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-17 18:34:59] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:34:59] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:34:59] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:00] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-17 18:35:00] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:35:00] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 183 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 171 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 153 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:35:04] [INFO ] Deduced a trap composed of 183 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 183 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 174 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:35:06] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:35:07] [INFO ] Deduced a trap composed of 177 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:35:08] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 3 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:35:09] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 1 ms to minimize.
[2022-05-17 18:35:10] [INFO ] Deduced a trap composed of 174 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:35:11] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:11] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:11] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 1 ms to minimize.
[2022-05-17 18:35:11] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:35:12] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 162 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 1 ms to minimize.
[2022-05-17 18:35:13] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 162 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:35:15] [INFO ] Deduced a trap composed of 153 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:35:15] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:35:15] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:16] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 1 ms to minimize.
[2022-05-17 18:35:16] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:17] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:35:17] [INFO ] Deduced a trap composed of 150 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:18] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:35:19] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:35:20] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:20] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:35:20] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:21] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 183 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:28] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 159 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:35:31] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:35:31] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:35:34] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:34] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:35:37] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:35:38] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:35:38] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 0 ms to minimize.
[2022-05-17 18:35:38] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:39] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:35:41] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:35:50] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 49875 ms
[2022-05-17 18:35:50] [INFO ] After 50262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:50] [INFO ] After 50358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:50] [INFO ] Flatten gal took : 113 ms
[2022-05-17 18:35:50] [INFO ] Flatten gal took : 81 ms
[2022-05-17 18:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9424194863423717490.gal : 22 ms
[2022-05-17 18:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15619292200059772518.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5837105114521774352;'/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/ReachabilityCardinality9424194863423717490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15619292200059772518.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/ReachabilityCardinality15619292200059772518.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 95
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95 after 1501
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1501 after 1759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1759 after 2570
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2570 after 3664
Detected timeout of ITS tools.
[2022-05-17 18:36:05] [INFO ] Flatten gal took : 60 ms
[2022-05-17 18:36:05] [INFO ] Applying decomposition
[2022-05-17 18:36:05] [INFO ] Flatten gal took : 58 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/graph16837087400028146909.txt' '-o' '/tmp/graph16837087400028146909.bin' '-w' '/tmp/graph16837087400028146909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16837087400028146909.bin' '-l' '-1' '-v' '-w' '/tmp/graph16837087400028146909.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:36:06] [INFO ] Decomposing Gal with order
[2022-05-17 18:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:36:06] [INFO ] Removed a total of 816 redundant transitions.
[2022-05-17 18:36:06] [INFO ] Flatten gal took : 292 ms
[2022-05-17 18:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 39 ms.
[2022-05-17 18:36:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12743306981362786457.gal : 12 ms
[2022-05-17 18:36:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2674232696357514494.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5837105114521774352;'/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/ReachabilityCardinality12743306981362786457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2674232696357514494.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/ReachabilityCardinality2674232696357514494.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2992085302974670396
[2022-05-17 18:36:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2992085302974670396
Running compilation step : cd /tmp/ltsmin2992085302974670396;'/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 1317 ms.
Running link step : cd /tmp/ltsmin2992085302974670396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2992085302974670396;'/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 530 transition count 742
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 530 transition count 741
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 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 61 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2022-05-17 18:36:36] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-17 18:36:36] [INFO ] [Real]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:36:36] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:36:36] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:36] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2022-05-17 18:36:36] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-17 18:36:37] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:37] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 0 ms to minimize.
[2022-05-17 18:36:37] [INFO ] Deduced a trap composed of 150 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:36:37] [INFO ] Deduced a trap composed of 171 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 183 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 174 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:36:38] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:36:39] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:39] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:36:39] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:36:39] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:36:39] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:36:40] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:36:41] [INFO ] Deduced a trap composed of 153 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:36:41] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:41] [INFO ] Deduced a trap composed of 153 places in 152 ms of which 1 ms to minimize.
[2022-05-17 18:36:41] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 1 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 174 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:42] [INFO ] Deduced a trap composed of 159 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 150 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 177 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 162 places in 155 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 159 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 171 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 168 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 159 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 168 places in 143 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 0 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 162 places in 145 ms of which 0 ms to minimize.
[2022-05-17 18:36:54] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:36:55] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 1 ms to minimize.
[2022-05-17 18:36:55] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 1 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 1 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:37:01] [INFO ] Deduced a trap composed of 156 places in 136 ms of which 1 ms to minimize.
[2022-05-17 18:37:01] [INFO ] Deduced a trap composed of 171 places in 141 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 0 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 165 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 1 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 1 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 183 places in 142 ms of which 0 ms to minimize.
[2022-05-17 18:37:04] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 1 ms to minimize.
[2022-05-17 18:37:04] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 0 ms to minimize.
[2022-05-17 18:37:04] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2022-05-17 18:37:05] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 169 places in 145 ms of which 1 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 153 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:37:06] [INFO ] Deduced a trap composed of 165 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:37:07] [INFO ] Deduced a trap composed of 171 places in 135 ms of which 0 ms to minimize.
[2022-05-17 18:37:07] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 1 ms to minimize.
[2022-05-17 18:37:07] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 1 ms to minimize.
[2022-05-17 18:37:07] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:37:08] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:37:08] [INFO ] Deduced a trap composed of 177 places in 140 ms of which 1 ms to minimize.
[2022-05-17 18:37:09] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 0 ms to minimize.
[2022-05-17 18:37:10] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 0 ms to minimize.
[2022-05-17 18:37:11] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2022-05-17 18:37:13] [INFO ] Deduced a trap composed of 168 places in 140 ms of which 0 ms to minimize.
[2022-05-17 18:37:14] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:37:15] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 1 ms to minimize.
[2022-05-17 18:37:15] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 0 ms to minimize.
[2022-05-17 18:37:15] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 0 ms to minimize.
[2022-05-17 18:37:18] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 0 ms to minimize.
[2022-05-17 18:37:27] [INFO ] Trap strengthening (SAT) tested/added 120/120 trap constraints in 49785 ms
[2022-05-17 18:37:27] [INFO ] After 50183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:27] [INFO ] After 50308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:27] [INFO ] Flatten gal took : 54 ms
[2022-05-17 18:37:27] [INFO ] Flatten gal took : 41 ms
[2022-05-17 18:37:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5784317964695823208.gal : 5 ms
[2022-05-17 18:37:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2326530699946446633.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/ReachabilityCardinality5784317964695823208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2326530699946446633.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/ReachabilityCardinality2326530699946446633.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :21 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37 after 51
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51 after 95
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95 after 1501
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1501 after 1759
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1759 after 2570
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2570 after 3664
Detected timeout of ITS tools.
[2022-05-17 18:37:42] [INFO ] Flatten gal took : 39 ms
[2022-05-17 18:37:42] [INFO ] Applying decomposition
[2022-05-17 18:37:42] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7542938304263586068.txt' '-o' '/tmp/graph7542938304263586068.bin' '-w' '/tmp/graph7542938304263586068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7542938304263586068.bin' '-l' '-1' '-v' '-w' '/tmp/graph7542938304263586068.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:37:42] [INFO ] Decomposing Gal with order
[2022-05-17 18:37:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:37:42] [INFO ] Removed a total of 816 redundant transitions.
[2022-05-17 18:37:42] [INFO ] Flatten gal took : 119 ms
[2022-05-17 18:37:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 466 labels/synchronizations in 31 ms.
[2022-05-17 18:37:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2504676174712848837.gal : 7 ms
[2022-05-17 18:37:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12885741413193669494.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/ReachabilityCardinality2504676174712848837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12885741413193669494.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/ReachabilityCardinality12885741413193669494.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11844810171738306436
[2022-05-17 18:37:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11844810171738306436
Running compilation step : cd /tmp/ltsmin11844810171738306436;'/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 1247 ms.
Running link step : cd /tmp/ltsmin11844810171738306436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11844810171738306436;'/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:12] [INFO ] Flatten gal took : 38 ms
[2022-05-17 18:38:12] [INFO ] Flatten gal took : 37 ms
[2022-05-17 18:38:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7290922851378155070.gal : 7 ms
[2022-05-17 18:38:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8579763894625853444.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/ReachabilityFireability7290922851378155070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8579763894625853444.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/ReachabilityFireability8579763894625853444.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
Detected timeout of ITS tools.
[2022-05-17 18:38:15] [INFO ] Flatten gal took : 33 ms
[2022-05-17 18:38:15] [INFO ] Applying decomposition
[2022-05-17 18:38:16] [INFO ] Flatten gal took : 33 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/graph9677449076032847836.txt' '-o' '/tmp/graph9677449076032847836.bin' '-w' '/tmp/graph9677449076032847836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9677449076032847836.bin' '-l' '-1' '-v' '-w' '/tmp/graph9677449076032847836.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:38:16] [INFO ] Decomposing Gal with order
[2022-05-17 18:38:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:38:16] [INFO ] Removed a total of 724 redundant transitions.
[2022-05-17 18:38:16] [INFO ] Flatten gal took : 115 ms
[2022-05-17 18:38:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 333 labels/synchronizations in 20 ms.
[2022-05-17 18:38:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11123525804176448998.gal : 6 ms
[2022-05-17 18:38:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7042567232084284961.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/ReachabilityFireability11123525804176448998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7042567232084284961.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/ReachabilityFireability7042567232084284961.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 67
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67 after 142
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :142 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 381
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :381 after 5.27996e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3068938660277527062
[2022-05-17 18:38:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3068938660277527062
Running compilation step : cd /tmp/ltsmin3068938660277527062;'/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 1264 ms.
Running link step : cd /tmp/ltsmin3068938660277527062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3068938660277527062;'/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:22] [INFO ] Flatten gal took : 42 ms
[2022-05-17 18:38:22] [INFO ] Flatten gal took : 32 ms
[2022-05-17 18:38:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18067365080369765001.gal : 5 ms
[2022-05-17 18:38:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6283951566907597899.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/ReachabilityFireability18067365080369765001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6283951566907597899.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/ReachabilityFireability6283951566907597899.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8076 after 59572
Detected timeout of ITS tools.
[2022-05-17 18:38:52] [INFO ] Flatten gal took : 30 ms
[2022-05-17 18:38:52] [INFO ] Applying decomposition
[2022-05-17 18:38:52] [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/graph7312702784277487269.txt' '-o' '/tmp/graph7312702784277487269.bin' '-w' '/tmp/graph7312702784277487269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7312702784277487269.bin' '-l' '-1' '-v' '-w' '/tmp/graph7312702784277487269.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:38:52] [INFO ] Decomposing Gal with order
[2022-05-17 18:38:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:38:52] [INFO ] Removed a total of 724 redundant transitions.
[2022-05-17 18:38:52] [INFO ] Flatten gal took : 73 ms
[2022-05-17 18:38:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 42 ms.
[2022-05-17 18:38:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5269073560309824287.gal : 5 ms
[2022-05-17 18:38:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1943644419180265483.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/ReachabilityFireability5269073560309824287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1943644419180265483.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/ReachabilityFireability1943644419180265483.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 786
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :786 after 816
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :816 after 846
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :846 after 906
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :906 after 1086
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1086 after 2720
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2720 after 2776
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2776 after 2896
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2896 after 3124
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3124 after 4297
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5370648080952512116
[2022-05-17 18:39:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5370648080952512116
Running compilation step : cd /tmp/ltsmin5370648080952512116;'/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 1247 ms.
Running link step : cd /tmp/ltsmin5370648080952512116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5370648080952512116;'/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:52] [INFO ] Flatten gal took : 30 ms
[2022-05-17 18:39:53] [INFO ] Flatten gal took : 28 ms
[2022-05-17 18:39:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14880381566530850329.gal : 4 ms
[2022-05-17 18:39:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11253679362604430841.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/ReachabilityFireability14880381566530850329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11253679362604430841.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/ReachabilityFireability11253679362604430841.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8076 after 59572
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59572 after 188478
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :188478 after 447244
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :447244 after 2.93943e+06
Detected timeout of ITS tools.
[2022-05-17 18:44:53] [INFO ] Flatten gal took : 30 ms
[2022-05-17 18:44:53] [INFO ] Applying decomposition
[2022-05-17 18:44:53] [INFO ] Flatten gal took : 29 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/graph2824252720388369402.txt' '-o' '/tmp/graph2824252720388369402.bin' '-w' '/tmp/graph2824252720388369402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2824252720388369402.bin' '-l' '-1' '-v' '-w' '/tmp/graph2824252720388369402.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:44:53] [INFO ] Decomposing Gal with order
[2022-05-17 18:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:44:53] [INFO ] Removed a total of 724 redundant transitions.
[2022-05-17 18:44:53] [INFO ] Flatten gal took : 132 ms
[2022-05-17 18:44:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 331 labels/synchronizations in 17 ms.
[2022-05-17 18:44:53] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11496158540479182043.gal : 5 ms
[2022-05-17 18:44:53] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8000979488305137850.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/ReachabilityFireability11496158540479182043.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8000979488305137850.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/ReachabilityFireability8000979488305137850.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13779473473487991293
[2022-05-17 18:49:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13779473473487991293
Running compilation step : cd /tmp/ltsmin13779473473487991293;'/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 1248 ms.
Running link step : cd /tmp/ltsmin13779473473487991293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13779473473487991293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.016: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.018: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.017: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.016: "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( 0/ 8), 0.018: There are 747 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 530, there are 746 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.018: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.017: "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( 0/ 8), 0.053: ~6 levels ~960 states ~4032 transitions
pins2lts-mc-linux64( 4/ 8), 0.132: ~2 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 4/ 8), 0.247: ~5 levels ~3840 states ~10096 transitions
pins2lts-mc-linux64( 4/ 8), 0.340: ~6 levels ~7680 states ~22472 transitions
pins2lts-mc-linux64( 3/ 8), 0.546: ~5 levels ~15360 states ~45704 transitions
pins2lts-mc-linux64( 3/ 8), 0.909: ~6 levels ~30720 states ~91088 transitions
pins2lts-mc-linux64( 3/ 8), 1.475: ~8 levels ~61440 states ~155952 transitions
pins2lts-mc-linux64( 3/ 8), 2.524: ~11 levels ~122880 states ~223768 transitions
pins2lts-mc-linux64( 3/ 8), 4.436: ~14 levels ~245760 states ~592032 transitions
pins2lts-mc-linux64( 3/ 8), 7.963: ~16 levels ~491520 states ~1162256 transitions
pins2lts-mc-linux64( 3/ 8), 15.496: ~34 levels ~983040 states ~4197696 transitions
pins2lts-mc-linux64( 3/ 8), 30.063: ~35 levels ~1966080 states ~8373384 transitions
pins2lts-mc-linux64( 3/ 8), 58.443: ~37 levels ~3932160 states ~13836808 transitions
pins2lts-mc-linux64( 3/ 8), 114.535: ~38 levels ~7864320 states ~21068304 transitions
pins2lts-mc-linux64( 4/ 8), 165.628: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 166.629:
pins2lts-mc-linux64( 0/ 8), 166.629: mean standard work distribution: 23.5% (states) 70.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 166.629:
pins2lts-mc-linux64( 0/ 8), 166.630: Explored 8964985 states 119797544 transitions, fanout: 13.363
pins2lts-mc-linux64( 0/ 8), 166.630: Total exploration time 166.610 sec (165.610 sec minimum, 165.739 sec on average)
pins2lts-mc-linux64( 0/ 8), 166.630: States per second: 53808, Transitions per second: 719030
pins2lts-mc-linux64( 0/ 8), 166.630:
pins2lts-mc-linux64( 0/ 8), 166.630: Queue width: 8B, total height: 29951058, memory: 228.51MB
pins2lts-mc-linux64( 0/ 8), 166.630: Tree memory: 551.4MB, 14.9 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 166.630: Tree fill ratio (roots/leafs): 28.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 166.630: Stored 858 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 166.630: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 166.630: Est. total memory use: 779.9MB (~1252.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13779473473487991293;'/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/ltsmin13779473473487991293;'/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:52:41] [INFO ] Flatten gal took : 31 ms
[2022-05-17 18:52:41] [INFO ] Flatten gal took : 29 ms
[2022-05-17 18:52:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15841368107553255818.gal : 18 ms
[2022-05-17 18:52:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5323047592277416401.prop : 2 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/ReachabilityFireability15841368107553255818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5323047592277416401.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/ReachabilityFireability5323047592277416401.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 25
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 46
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :46 after 474
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :474 after 721
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :721 after 1025
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1025 after 1888
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1888 after 3474
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3474 after 8076
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8076 after 59572
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :59572 after 188478
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :188478 after 447244
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :447244 after 2.93943e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :2.93943e+06 after 1.1519e+07

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-S05J40"
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-S05J40, 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-165277024500467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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