Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678871734233

Running Version 202205111006
[2023-03-15 09:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:15:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 09:15:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:15:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 650 ms
[2023-03-15 09:15:36] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 22 ms.
[2023-03-15 09:15:36] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 52 ms.
[2023-03-15 09:15:36] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:15:36] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 09:15:36] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 09:15:36] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10000 steps, including 149 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 09:15:37] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-15 09:15:37] [INFO ] Computed 82 place invariants in 47 ms
[2023-03-15 09:15:37] [INFO ] [Real]Absence check using 75 positive place invariants in 34 ms returned sat
[2023-03-15 09:15:37] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 09:15:37] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:15:37] [INFO ] [Nat]Absence check using 75 positive place invariants in 26 ms returned sat
[2023-03-15 09:15:37] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 09:15:38] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:15:45] [INFO ] After 6766ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:15:45] [INFO ] After 6858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-15 09:15:45] [INFO ] After 7731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 410 transition count 671
Applied a total of 153 rules in 157 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
[2023-03-15 09:15:45] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2023-03-15 09:15:45] [INFO ] Computed 77 place invariants in 30 ms
[2023-03-15 09:15:46] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/489 places, 576/745 transitions.
Incomplete random walk after 1000000 steps, including 52018 resets, run finished after 3532 ms. (steps per millisecond=283 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5533 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2991031 steps, run timeout after 12001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 2991031 steps, saw 873852 distinct states, run finished after 12002 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:02] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:02] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-15 09:16:02] [INFO ] [Real]Absence check using 70 positive place invariants in 19 ms returned sat
[2023-03-15 09:16:03] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 109 ms returned sat
[2023-03-15 09:16:03] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:03] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 09:16:03] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 09:16:03] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:03] [INFO ] After 140ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:03] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 2 ms to minimize.
[2023-03-15 09:16:03] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 1 ms to minimize.
[2023-03-15 09:16:03] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 1 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:16:04] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:16:05] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:16:05] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:16:05] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2023-03-15 09:16:05] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:16:06] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:16:07] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:16:08] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:08] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:16:08] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:16:08] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:16:09] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:09] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:16:09] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-15 09:16:09] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 1 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2023-03-15 09:16:10] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:16:11] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:16:12] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:16:12] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 1 ms to minimize.
[2023-03-15 09:16:21] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17860 ms
[2023-03-15 09:16:21] [INFO ] After 18050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:16:21] [INFO ] After 18382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 09:16:21] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:21] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-15 09:16:21] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-15 09:16:21] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:21] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-15 09:16:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:22] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2023-03-15 09:16:22] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-15 09:16:22] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:23] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-15 09:16:23] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5206 resets, run finished after 529 ms. (steps per millisecond=189 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:23] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:23] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-15 09:16:23] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 09:16:23] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:16:23] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:23] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 09:16:24] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:16:24] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:24] [INFO ] After 145ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:24] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:24] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:16:24] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:16:24] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 0 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:16:25] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:16:26] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:26] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 4 ms to minimize.
[2023-03-15 09:16:26] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:16:26] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:16:27] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 3 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 4 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:16:28] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 1 ms to minimize.
[2023-03-15 09:16:29] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:16:29] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:16:29] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:16:30] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:16:31] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 1 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:16:32] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 1 ms to minimize.
[2023-03-15 09:16:33] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:16:42] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17865 ms
[2023-03-15 09:16:42] [INFO ] After 18048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:16:42] [INFO ] After 18307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000001 steps, including 51980 resets, run finished after 3506 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5462 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3089063 steps, run timeout after 12001 ms. (steps per millisecond=257 ) properties seen :{}
Probabilistic random walk after 3089063 steps, saw 902980 distinct states, run finished after 12001 ms. (steps per millisecond=257 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:58] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:16:58] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-15 09:16:58] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-15 09:16:58] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 09:16:58] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 09:16:58] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:16:59] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:59] [INFO ] After 144ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 1 ms to minimize.
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:16:59] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 1 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 0 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 1 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 5 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 0 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 0 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 1 ms to minimize.
[2023-03-15 09:17:02] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:17:03] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:17:03] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 1 ms to minimize.
[2023-03-15 09:17:03] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 1 ms to minimize.
[2023-03-15 09:17:03] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 1 ms to minimize.
[2023-03-15 09:17:03] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 1 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 0 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2023-03-15 09:17:04] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:17:05] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:17:05] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:17:05] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 0 ms to minimize.
[2023-03-15 09:17:05] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 0 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 1 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:17:07] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:17:07] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 1 ms to minimize.
[2023-03-15 09:17:07] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:17:08] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 0 ms to minimize.
[2023-03-15 09:17:08] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 0 ms to minimize.
[2023-03-15 09:17:08] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:17:17] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 18148 ms
[2023-03-15 09:17:17] [INFO ] After 18353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:17] [INFO ] After 18630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 09:17:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:17:17] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-15 09:17:17] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-15 09:17:17] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:17:17] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 09:17:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:19] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2023-03-15 09:17:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 09:17:19] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:17:19] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 09:17:19] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 100000 steps, including 5187 resets, run finished after 362 ms. (steps per millisecond=276 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:20] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:17:20] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-15 09:17:20] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 09:17:20] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:17:20] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 09:17:20] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-15 09:17:20] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:20] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:20] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:20] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 0 ms to minimize.
[2023-03-15 09:17:20] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 1 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 1 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 1 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2023-03-15 09:17:21] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:17:22] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2023-03-15 09:17:22] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-15 09:17:22] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 0 ms to minimize.
[2023-03-15 09:17:22] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 128 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 1 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:17:23] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 1 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 1 ms to minimize.
[2023-03-15 09:17:38] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17835 ms
[2023-03-15 09:17:38] [INFO ] After 18048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:38] [INFO ] After 18318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 498 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 696177 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 696177 steps, saw 214881 distinct states, run finished after 3004 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:41] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:17:41] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-15 09:17:41] [INFO ] [Real]Absence check using 70 positive place invariants in 20 ms returned sat
[2023-03-15 09:17:41] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:17:41] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:41] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 09:17:41] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 09:17:41] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:42] [INFO ] After 109ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 0 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 0 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 0 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 1 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 138 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:17:47] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:17:47] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:17:47] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:17:47] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:17:58] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:17:58] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:18:06] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24657 ms
[2023-03-15 09:18:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:18:06] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 09:18:06] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:18:06] [INFO ] Computed 77 place invariants in 9 ms
[2023-03-15 09:18:07] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 695913 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695913 steps, saw 214797 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:18:10] [INFO ] Computed 77 place invariants in 31 ms
[2023-03-15 09:18:10] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 09:18:10] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 09:18:10] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:10] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-15 09:18:10] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:18:10] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:10] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:18:11] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:18:12] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2023-03-15 09:18:13] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:18:14] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:18:15] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 2 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:18:26] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:18:27] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2023-03-15 09:18:35] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 24598 ms
[2023-03-15 09:18:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:18:35] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 09:18:35] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:18:35] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-15 09:18:35] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-15 09:18:35] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:18:35] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-15 09:18:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:36] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-15 09:18:36] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 09:18:36] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 09:18:36] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 09:18:37] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 68 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-15 09:18:37] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-15 09:18:37] [INFO ] [Real]Absence check using 70 positive place invariants in 136 ms returned sat
[2023-03-15 09:18:37] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:18:37] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:37] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-15 09:18:37] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 09:18:37] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:37] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:18:37] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 1 ms to minimize.
[2023-03-15 09:18:39] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 1 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:18:41] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 126 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 0 ms to minimize.
[2023-03-15 09:18:42] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 1 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 1 ms to minimize.
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 1 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:19:01] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2023-03-15 09:19:05] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:19:06] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:19:07] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 1 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:19:32] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:19:55] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:19:56] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:20:05] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 88066 ms
[2023-03-15 09:20:05] [INFO ] After 88279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:05] [INFO ] After 88370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:05] [INFO ] Flatten gal took : 115 ms
[2023-03-15 09:20:06] [INFO ] Flatten gal took : 71 ms
[2023-03-15 09:20:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16727457934929351621.gal : 20 ms
[2023-03-15 09:20:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2529220695430021591.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9015030680093131278;'/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/ReachabilityCardinality16727457934929351621.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2529220695430021591.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/ReachabilityCardinality2529220695430021591.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 45
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45 after 59
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59 after 1318
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1318 after 1437
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 1972
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1972 after 2879
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2879 after 4151
Detected timeout of ITS tools.
[2023-03-15 09:20:21] [INFO ] Flatten gal took : 56 ms
[2023-03-15 09:20:21] [INFO ] Applying decomposition
[2023-03-15 09:20:21] [INFO ] Flatten gal took : 50 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/graph7560598263929807851.txt' '-o' '/tmp/graph7560598263929807851.bin' '-w' '/tmp/graph7560598263929807851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7560598263929807851.bin' '-l' '-1' '-v' '-w' '/tmp/graph7560598263929807851.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:20:21] [INFO ] Decomposing Gal with order
[2023-03-15 09:20:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:20:21] [INFO ] Removed a total of 726 redundant transitions.
[2023-03-15 09:20:21] [INFO ] Flatten gal took : 132 ms
[2023-03-15 09:20:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 21 ms.
[2023-03-15 09:20:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5978702957177669777.gal : 11 ms
[2023-03-15 09:20:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2883758201198379448.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9015030680093131278;'/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/ReachabilityCardinality5978702957177669777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2883758201198379448.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/ReachabilityCardinality2883758201198379448.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16891974503561847588
[2023-03-15 09:20:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16891974503561847588
Running compilation step : cd /tmp/ltsmin16891974503561847588;'/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 1091 ms.
Running link step : cd /tmp/ltsmin16891974503561847588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16891974503561847588;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 44 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-15 09:20:51] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-15 09:20:51] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 09:20:52] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 09:20:52] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:52] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-15 09:20:52] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 09:20:52] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 1 ms to minimize.
[2023-03-15 09:20:52] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 0 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:20:53] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:20:54] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2023-03-15 09:20:55] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:20:56] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:20:57] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 1 ms to minimize.
[2023-03-15 09:20:59] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:21:00] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:21:01] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:21:02] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:21:03] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 0 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 0 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:21:28] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 1 ms to minimize.
[2023-03-15 09:21:29] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2023-03-15 09:21:33] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 0 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2023-03-15 09:22:00] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 1 ms to minimize.
[2023-03-15 09:22:05] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-15 09:22:10] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 0 ms to minimize.
[2023-03-15 09:22:11] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 1 ms to minimize.
[2023-03-15 09:22:20] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 87968 ms
[2023-03-15 09:22:20] [INFO ] After 88220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:20] [INFO ] After 88325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:20] [INFO ] Flatten gal took : 38 ms
[2023-03-15 09:22:20] [INFO ] Flatten gal took : 34 ms
[2023-03-15 09:22:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15124635122141522636.gal : 5 ms
[2023-03-15 09:22:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12441574893350801729.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/ReachabilityCardinality15124635122141522636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12441574893350801729.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/ReachabilityCardinality12441574893350801729.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 39
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :39 after 45
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45 after 59
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :59 after 1318
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1318 after 1437
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1437 after 1972
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1972 after 2879
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2879 after 4151
Detected timeout of ITS tools.
[2023-03-15 09:22:35] [INFO ] Flatten gal took : 36 ms
[2023-03-15 09:22:35] [INFO ] Applying decomposition
[2023-03-15 09:22:35] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7637782840995382954.txt' '-o' '/tmp/graph7637782840995382954.bin' '-w' '/tmp/graph7637782840995382954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7637782840995382954.bin' '-l' '-1' '-v' '-w' '/tmp/graph7637782840995382954.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:22:35] [INFO ] Decomposing Gal with order
[2023-03-15 09:22:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:22:35] [INFO ] Removed a total of 636 redundant transitions.
[2023-03-15 09:22:35] [INFO ] Flatten gal took : 115 ms
[2023-03-15 09:22:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 275 labels/synchronizations in 17 ms.
[2023-03-15 09:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4089479653075248790.gal : 8 ms
[2023-03-15 09:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10505047508478949726.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/ReachabilityCardinality4089479653075248790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10505047508478949726.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/ReachabilityCardinality10505047508478949726.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17561637887726480903
[2023-03-15 09:22:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17561637887726480903
Running compilation step : cd /tmp/ltsmin17561637887726480903;'/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 953 ms.
Running link step : cd /tmp/ltsmin17561637887726480903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17561637887726480903;'/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.
[2023-03-15 09:23:06] [INFO ] Flatten gal took : 30 ms
[2023-03-15 09:23:06] [INFO ] Flatten gal took : 28 ms
[2023-03-15 09:23:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11205350791430216797.gal : 6 ms
[2023-03-15 09:23:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16925444276083847356.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/ReachabilityFireability11205350791430216797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16925444276083847356.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/ReachabilityFireability16925444276083847356.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
Detected timeout of ITS tools.
[2023-03-15 09:23:09] [INFO ] Flatten gal took : 28 ms
[2023-03-15 09:23:09] [INFO ] Applying decomposition
[2023-03-15 09:23:09] [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/graph13451760131113131310.txt' '-o' '/tmp/graph13451760131113131310.bin' '-w' '/tmp/graph13451760131113131310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13451760131113131310.bin' '-l' '-1' '-v' '-w' '/tmp/graph13451760131113131310.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:23:09] [INFO ] Decomposing Gal with order
[2023-03-15 09:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:23:09] [INFO ] Removed a total of 638 redundant transitions.
[2023-03-15 09:23:09] [INFO ] Flatten gal took : 60 ms
[2023-03-15 09:23:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 11 ms.
[2023-03-15 09:23:09] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1917958140858269678.gal : 6 ms
[2023-03-15 09:23:09] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10500671733584438833.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/ReachabilityFireability1917958140858269678.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10500671733584438833.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/ReachabilityFireability10500671733584438833.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 67
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :67 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 79
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :79 after 135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135 after 210
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :210 after 1.18912e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.18912e+06 after 1.18912e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6904434709992564591
[2023-03-15 09:23:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6904434709992564591
Running compilation step : cd /tmp/ltsmin6904434709992564591;'/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 1003 ms.
Running link step : cd /tmp/ltsmin6904434709992564591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6904434709992564591;'/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.
[2023-03-15 09:23:15] [INFO ] Flatten gal took : 29 ms
[2023-03-15 09:23:15] [INFO ] Flatten gal took : 38 ms
[2023-03-15 09:23:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6068096220104115580.gal : 3 ms
[2023-03-15 09:23:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18140811852945105374.prop : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6068096220104115580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18140811852945105374.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/ReachabilityFireability18140811852945105374.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
Detected timeout of ITS tools.
[2023-03-15 09:23:45] [INFO ] Flatten gal took : 24 ms
[2023-03-15 09:23:45] [INFO ] Applying decomposition
[2023-03-15 09:23:45] [INFO ] Flatten gal took : 23 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/graph14237132745030327934.txt' '-o' '/tmp/graph14237132745030327934.bin' '-w' '/tmp/graph14237132745030327934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14237132745030327934.bin' '-l' '-1' '-v' '-w' '/tmp/graph14237132745030327934.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:23:45] [INFO ] Decomposing Gal with order
[2023-03-15 09:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:23:45] [INFO ] Removed a total of 544 redundant transitions.
[2023-03-15 09:23:45] [INFO ] Flatten gal took : 152 ms
[2023-03-15 09:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 18 ms.
[2023-03-15 09:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9969610620126386885.gal : 6 ms
[2023-03-15 09:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16190741121806208106.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/ReachabilityFireability9969610620126386885.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16190741121806208106.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/ReachabilityFireability16190741121806208106.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 1420
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1420 after 2776
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2776 after 2801
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2801 after 18098
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :18098 after 57760
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :57760 after 8.4116e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.4116e+06 after 1.23137e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13877436145195915344
[2023-03-15 09:24:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13877436145195915344
Running compilation step : cd /tmp/ltsmin13877436145195915344;'/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 963 ms.
Running link step : cd /tmp/ltsmin13877436145195915344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13877436145195915344;'/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.
[2023-03-15 09:24:46] [INFO ] Flatten gal took : 24 ms
[2023-03-15 09:24:46] [INFO ] Flatten gal took : 23 ms
[2023-03-15 09:24:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7539019366620462986.gal : 3 ms
[2023-03-15 09:24:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7610145045223251032.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/ReachabilityFireability7539019366620462986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7610145045223251032.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/ReachabilityFireability7610145045223251032.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :95398 after 329502
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :329502 after 2.66494e+06
Detected timeout of ITS tools.
[2023-03-15 09:29:46] [INFO ] Flatten gal took : 24 ms
[2023-03-15 09:29:46] [INFO ] Applying decomposition
[2023-03-15 09:29:46] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12567706906063199845.txt' '-o' '/tmp/graph12567706906063199845.bin' '-w' '/tmp/graph12567706906063199845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12567706906063199845.bin' '-l' '-1' '-v' '-w' '/tmp/graph12567706906063199845.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:29:46] [INFO ] Decomposing Gal with order
[2023-03-15 09:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:29:46] [INFO ] Removed a total of 634 redundant transitions.
[2023-03-15 09:29:46] [INFO ] Flatten gal took : 53 ms
[2023-03-15 09:29:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 13 ms.
[2023-03-15 09:29:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15664616556489615081.gal : 5 ms
[2023-03-15 09:29:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2344057704409968358.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/ReachabilityFireability15664616556489615081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2344057704409968358.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/ReachabilityFireability2344057704409968358.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 88
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :88 after 98
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :98 after 144
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :144 after 276
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :276 after 665030
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :665030 after 665030
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :665030 after 1.35717e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.35717e+07 after 1.0442e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.0442e+08 after 1.06139e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.06139e+08 after 1.13775e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.13775e+08 after 1.29431e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17211700359677543224
[2023-03-15 09:34:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17211700359677543224
Running compilation step : cd /tmp/ltsmin17211700359677543224;'/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 954 ms.
Running link step : cd /tmp/ltsmin17211700359677543224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17211700359677543224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 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( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.146: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.143: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.143: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.143: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.146: There are 577 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.146: State length is 410, there are 576 groups
pins2lts-mc-linux64( 0/ 8), 0.146: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.146: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.146: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.146: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.144: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.144: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.143: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.143: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.225: ~6 levels ~960 states ~4856 transitions
pins2lts-mc-linux64( 3/ 8), 0.257: ~6 levels ~1920 states ~6072 transitions
pins2lts-mc-linux64( 1/ 8), 0.312: ~6 levels ~3840 states ~13104 transitions
pins2lts-mc-linux64( 5/ 8), 0.387: ~10 levels ~7680 states ~21704 transitions
pins2lts-mc-linux64( 4/ 8), 0.557: ~12 levels ~15360 states ~43464 transitions
pins2lts-mc-linux64( 4/ 8), 0.863: ~18 levels ~30720 states ~78560 transitions
pins2lts-mc-linux64( 4/ 8), 1.336: ~22 levels ~61440 states ~157152 transitions
pins2lts-mc-linux64( 2/ 8), 2.246: ~18 levels ~122880 states ~282528 transitions
pins2lts-mc-linux64( 2/ 8), 3.684: ~20 levels ~245760 states ~607000 transitions
pins2lts-mc-linux64( 2/ 8), 6.164: ~29 levels ~491520 states ~1312136 transitions
pins2lts-mc-linux64( 2/ 8), 10.722: ~36 levels ~983040 states ~2085816 transitions
pins2lts-mc-linux64( 2/ 8), 19.916: ~56 levels ~1966080 states ~4220856 transitions
pins2lts-mc-linux64( 6/ 8), 40.190: ~82 levels ~3932160 states ~12389304 transitions
pins2lts-mc-linux64( 4/ 8), 77.021: ~51 levels ~7864320 states ~17817088 transitions
pins2lts-mc-linux64( 1/ 8), 151.448: ~40 levels ~15728640 states ~35298864 transitions
pins2lts-mc-linux64( 2/ 8), 157.022: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 157.320:
pins2lts-mc-linux64( 0/ 8), 157.320: mean standard work distribution: 18.8% (states) 68.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 157.320:
pins2lts-mc-linux64( 0/ 8), 157.320: Explored 13977123 states 74685809 transitions, fanout: 5.343
pins2lts-mc-linux64( 0/ 8), 157.320: Total exploration time 157.170 sec (156.880 sec minimum, 156.960 sec on average)
pins2lts-mc-linux64( 0/ 8), 157.320: States per second: 88930, Transitions per second: 475191
pins2lts-mc-linux64( 0/ 8), 157.320:
pins2lts-mc-linux64( 0/ 8), 157.320: Queue width: 8B, total height: 13289082, memory: 101.39MB
pins2lts-mc-linux64( 0/ 8), 157.320: Tree memory: 460.6MB, 18.0 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 157.320: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 157.320: Stored 653 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 157.321: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 157.321: Est. total memory use: 562.0MB (~1125.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17211700359677543224;'/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/ltsmin17211700359677543224;'/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)
[2023-03-15 09:37:25] [INFO ] Flatten gal took : 26 ms
[2023-03-15 09:37:25] [INFO ] Flatten gal took : 23 ms
[2023-03-15 09:37:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6850240154757974195.gal : 3 ms
[2023-03-15 09:37:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17580905745359305511.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/ReachabilityFireability6850240154757974195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17580905745359305511.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/ReachabilityFireability17580905745359305511.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 171
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :171 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 303
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :303 after 547
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :547 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 1872
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1872 after 4049
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4049 after 27722
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27722 after 95398
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :95398 after 329502
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :329502 after 2.66494e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.66494e+06 after 5.10811e+06

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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-S05J30"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-COL-S05J30, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r320-tall-167873970500402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;