Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 8.8K Apr 30 03:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 03:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 03:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 03:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652812339697

Running Version 202205111006
[2022-05-17 18:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 18:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:32:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 18:32:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 18:32:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 638 ms
[2022-05-17 18:32:21] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 24 ms.
[2022-05-17 18:32:21] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 57 ms.
[2022-05-17 18:32:21] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2022-05-17 18:32:21] [INFO ] Reduced 555 identical enabling conditions.
[2022-05-17 18:32:21] [INFO ] Reduced 90 identical enabling conditions.
[2022-05-17 18:32:21] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 688 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-17 18:32:22] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2022-05-17 18:32:22] [INFO ] Computed 142 place invariants in 117 ms
[2022-05-17 18:32:23] [INFO ] [Real]Absence check using 135 positive place invariants in 52 ms returned sat
[2022-05-17 18:32:23] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:32:24] [INFO ] After 712ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:32:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:24] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:32:24] [INFO ] After 208ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-17 18:32:24] [INFO ] After 1489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2022-05-17 18:32:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2022-05-17 18:32:24] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2022-05-17 18:32:25] [INFO ] After 977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 18:32:26] [INFO ] After 975ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 18:32:27] [INFO ] Deduced a trap composed of 507 places in 332 ms of which 1 ms to minimize.
[2022-05-17 18:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2022-05-17 18:32:27] [INFO ] After 1876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 397 ms.
[2022-05-17 18:32:27] [INFO ] After 3558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 174 ms.
Support contains 11 out of 909 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 904 transition count 1250
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 135 place count 839 transition count 1250
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 135 place count 839 transition count 1187
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 261 place count 776 transition count 1187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 775 transition count 1186
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 775 transition count 1186
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 267 place count 773 transition count 1184
Applied a total of 267 rules in 255 ms. Remains 773 /909 variables (removed 136) and now considering 1184/1315 (removed 131) transitions.
[2022-05-17 18:32:28] [INFO ] Flow matrix only has 1180 transitions (discarded 4 similar events)
// Phase 1: matrix 1180 rows 773 cols
[2022-05-17 18:32:28] [INFO ] Computed 137 place invariants in 76 ms
[2022-05-17 18:32:29] [INFO ] Dead Transitions using invariants and state equation in 885 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 : 773/909 places, 1089/1315 transitions.
Applied a total of 0 rules in 47 ms. Remains 773 /773 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 773/909 places, 1089/1315 transitions.
Incomplete random walk after 1000000 steps, including 44446 resets, run finished after 4735 ms. (steps per millisecond=211 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3389 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:32:35] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2022-05-17 18:32:35] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-17 18:32:35] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:32:35] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-17 18:32:35] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:32:35] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2022-05-17 18:32:35] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-17 18:32:35] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:32:36] [INFO ] After 335ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:32:36] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:32:36] [INFO ] Deduced a trap composed of 250 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:32:37] [INFO ] Deduced a trap composed of 223 places in 226 ms of which 1 ms to minimize.
[2022-05-17 18:32:37] [INFO ] Deduced a trap composed of 241 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:32:37] [INFO ] Deduced a trap composed of 235 places in 238 ms of which 1 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 229 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:32:38] [INFO ] Deduced a trap composed of 235 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:32:39] [INFO ] Deduced a trap composed of 238 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:32:39] [INFO ] Deduced a trap composed of 223 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:32:39] [INFO ] Deduced a trap composed of 241 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:32:40] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:32:40] [INFO ] Deduced a trap composed of 256 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:32:40] [INFO ] Deduced a trap composed of 247 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:32:41] [INFO ] Deduced a trap composed of 232 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:32:41] [INFO ] Deduced a trap composed of 247 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:32:42] [INFO ] Deduced a trap composed of 223 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:32:44] [INFO ] Deduced a trap composed of 241 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:32:53] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 17189 ms
[2022-05-17 18:32:53] [INFO ] After 17577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:32:53] [INFO ] After 18059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 773 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 773/773 places, 1089/1089 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 773 transition count 1088
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 772 transition count 1088
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 772 transition count 1086
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 6 place count 770 transition count 1086
Applied a total of 6 rules in 61 ms. Remains 770 /773 variables (removed 3) and now considering 1086/1089 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/773 places, 1086/1089 transitions.
Incomplete random walk after 1000000 steps, including 51938 resets, run finished after 5192 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3438 resets, run finished after 1357 ms. (steps per millisecond=736 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2010399 steps, run timeout after 18001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 2010399 steps, saw 623513 distinct states, run finished after 18002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:18] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:33:18] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-17 18:33:18] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:33:18] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:33:18] [INFO ] After 327ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:18] [INFO ] After 125ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:18] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:18] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:33:18] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:33:19] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:19] [INFO ] After 353ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:19] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 1 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 252 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 243 places in 233 ms of which 1 ms to minimize.
[2022-05-17 18:33:20] [INFO ] Deduced a trap composed of 243 places in 242 ms of which 1 ms to minimize.
[2022-05-17 18:33:21] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 0 ms to minimize.
[2022-05-17 18:33:21] [INFO ] Deduced a trap composed of 258 places in 221 ms of which 2 ms to minimize.
[2022-05-17 18:33:21] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 0 ms to minimize.
[2022-05-17 18:33:22] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 0 ms to minimize.
[2022-05-17 18:33:22] [INFO ] Deduced a trap composed of 245 places in 238 ms of which 1 ms to minimize.
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 2 ms to minimize.
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:33:23] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:33:24] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 2 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 218 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 251 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:33:25] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:33:26] [INFO ] Deduced a trap composed of 239 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 227 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 251 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:33:27] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 1 ms to minimize.
[2022-05-17 18:33:28] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:33:29] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:33:29] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:33:30] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:33:30] [INFO ] Deduced a trap composed of 239 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:33:30] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:33:30] [INFO ] Deduced a trap composed of 248 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:33:31] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 2 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:33:32] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 257 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 5 ms to minimize.
[2022-05-17 18:33:33] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:33:34] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:33:35] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:33:37] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:33:46] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 26665 ms
[2022-05-17 18:33:46] [INFO ] After 27097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:33:46] [INFO ] After 27571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-17 18:33:46] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:33:46] [INFO ] Computed 137 place invariants in 16 ms
[2022-05-17 18:33:47] [INFO ] Implicit Places using invariants in 767 ms returned []
[2022-05-17 18:33:47] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:33:47] [INFO ] Computed 137 place invariants in 30 ms
[2022-05-17 18:33:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:52] [INFO ] Implicit Places using invariants and state equation in 4901 ms returned []
Implicit Place search using SMT with State Equation took 5672 ms to find 0 implicit places.
[2022-05-17 18:33:52] [INFO ] Redundant transitions in 72 ms returned []
[2022-05-17 18:33:52] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:33:52] [INFO ] Computed 137 place invariants in 25 ms
[2022-05-17 18:33:52] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5209 resets, run finished after 613 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:33:53] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:33:53] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-17 18:33:53] [INFO ] [Real]Absence check using 130 positive place invariants in 55 ms returned sat
[2022-05-17 18:33:53] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:33:54] [INFO ] After 323ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:33:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:33:54] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:54] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:33:54] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:33:54] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:33:54] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:55] [INFO ] After 350ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:33:55] [INFO ] Deduced a trap composed of 230 places in 231 ms of which 1 ms to minimize.
[2022-05-17 18:33:55] [INFO ] Deduced a trap composed of 252 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:33:55] [INFO ] Deduced a trap composed of 243 places in 240 ms of which 1 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 243 places in 240 ms of which 1 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 1 ms to minimize.
[2022-05-17 18:33:56] [INFO ] Deduced a trap composed of 258 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:33:57] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:33:57] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 2 ms to minimize.
[2022-05-17 18:33:58] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:33:58] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:33:58] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:33:59] [INFO ] Deduced a trap composed of 233 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:33:59] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 218 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:34:00] [INFO ] Deduced a trap composed of 251 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:34:01] [INFO ] Deduced a trap composed of 227 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:34:01] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 227 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:34:02] [INFO ] Deduced a trap composed of 251 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:34:03] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:34:04] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:34:05] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:06] [INFO ] Deduced a trap composed of 227 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 251 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:34:07] [INFO ] Deduced a trap composed of 224 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 257 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:34:08] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:09] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:34:10] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:34:12] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:34:21] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 26480 ms
[2022-05-17 18:34:21] [INFO ] After 26931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:34:21] [INFO ] After 27409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51947 resets, run finished after 5218 ms. (steps per millisecond=191 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3409 resets, run finished after 1332 ms. (steps per millisecond=750 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2019141 steps, run timeout after 18001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 2019141 steps, saw 626077 distinct states, run finished after 18001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:34:46] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:34:46] [INFO ] Computed 137 place invariants in 28 ms
[2022-05-17 18:34:46] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:34:46] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:34:46] [INFO ] After 335ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:34:46] [INFO ] After 115ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:46] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:34:46] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2022-05-17 18:34:46] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:34:47] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:47] [INFO ] After 358ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:34:47] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2022-05-17 18:34:48] [INFO ] Deduced a trap composed of 252 places in 235 ms of which 1 ms to minimize.
[2022-05-17 18:34:48] [INFO ] Deduced a trap composed of 243 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:34:48] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 0 ms to minimize.
[2022-05-17 18:34:49] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:34:49] [INFO ] Deduced a trap composed of 258 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:34:49] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:34:50] [INFO ] Deduced a trap composed of 239 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:34:50] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 1 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:34:51] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:34:52] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:34:52] [INFO ] Deduced a trap composed of 218 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:34:53] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:34:53] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:34:53] [INFO ] Deduced a trap composed of 227 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:34:54] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:34:55] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:34:56] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 1 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:34:57] [INFO ] Deduced a trap composed of 233 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:34:58] [INFO ] Deduced a trap composed of 248 places in 229 ms of which 0 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:34:59] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:35:00] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 257 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:35:01] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 0 ms to minimize.
[2022-05-17 18:35:02] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:35:03] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:35:05] [INFO ] Deduced a trap composed of 227 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:14] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 26615 ms
[2022-05-17 18:35:14] [INFO ] After 27053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:14] [INFO ] After 27526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-17 18:35:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:35:14] [INFO ] Computed 137 place invariants in 18 ms
[2022-05-17 18:35:15] [INFO ] Implicit Places using invariants in 771 ms returned []
[2022-05-17 18:35:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:35:15] [INFO ] Computed 137 place invariants in 16 ms
[2022-05-17 18:35:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:35:19] [INFO ] Implicit Places using invariants and state equation in 4028 ms returned []
Implicit Place search using SMT with State Equation took 4804 ms to find 0 implicit places.
[2022-05-17 18:35:19] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-17 18:35:19] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:35:19] [INFO ] Computed 137 place invariants in 22 ms
[2022-05-17 18:35:19] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5219 resets, run finished after 525 ms. (steps per millisecond=190 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:35:20] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:35:20] [INFO ] Computed 137 place invariants in 24 ms
[2022-05-17 18:35:20] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:35:20] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:35:20] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:35:21] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:21] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:21] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2022-05-17 18:35:21] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:35:21] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:21] [INFO ] After 352ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 0 ms to minimize.
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 252 places in 232 ms of which 1 ms to minimize.
[2022-05-17 18:35:22] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 0 ms to minimize.
[2022-05-17 18:35:23] [INFO ] Deduced a trap composed of 243 places in 230 ms of which 0 ms to minimize.
[2022-05-17 18:35:23] [INFO ] Deduced a trap composed of 245 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:35:23] [INFO ] Deduced a trap composed of 258 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 0 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2022-05-17 18:35:24] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 1 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:35:25] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:35:26] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Deduced a trap composed of 218 places in 217 ms of which 0 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:35:27] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:35:28] [INFO ] Deduced a trap composed of 227 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:35:28] [INFO ] Deduced a trap composed of 239 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 227 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:35:29] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:35:30] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 0 ms to minimize.
[2022-05-17 18:35:31] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:35:31] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 239 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:35:32] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:33] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 1 ms to minimize.
[2022-05-17 18:35:33] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:35:34] [INFO ] Deduced a trap composed of 251 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:35:34] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:35:35] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:35:35] [INFO ] Deduced a trap composed of 257 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:35:35] [INFO ] Deduced a trap composed of 245 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:35:36] [INFO ] Deduced a trap composed of 236 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:35:36] [INFO ] Deduced a trap composed of 248 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:35:37] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:39] [INFO ] Deduced a trap composed of 227 places in 228 ms of which 1 ms to minimize.
[2022-05-17 18:35:48] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 26647 ms
[2022-05-17 18:35:48] [INFO ] After 27122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:35:48] [INFO ] After 27607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 513 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 330562 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330562 steps, saw 100547 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:35:51] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:35:51] [INFO ] Computed 137 place invariants in 26 ms
[2022-05-17 18:35:51] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:35:51] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:35:52] [INFO ] After 328ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:35:52] [INFO ] After 120ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:52] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:35:52] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2022-05-17 18:35:52] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:35:52] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:53] [INFO ] After 149ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 251 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:35:53] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:54] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:35:55] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 254 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 257 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:35:56] [INFO ] Deduced a trap composed of 254 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:35:57] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:35:57] [INFO ] Deduced a trap composed of 215 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:35:57] [INFO ] Deduced a trap composed of 221 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:35:57] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:35:58] [INFO ] Deduced a trap composed of 254 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:35:58] [INFO ] Deduced a trap composed of 227 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:35:58] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:35:59] [INFO ] Deduced a trap composed of 233 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:35:59] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:36:00] [INFO ] Deduced a trap composed of 251 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:36:02] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:02] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:02] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:36:02] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:36:03] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:12] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 19260 ms
[2022-05-17 18:36:12] [INFO ] After 19580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:36:12] [INFO ] After 20064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 23 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-17 18:36:12] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:36:12] [INFO ] Computed 137 place invariants in 19 ms
[2022-05-17 18:36:13] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 10000 steps, including 531 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331498 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331498 steps, saw 100831 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 18:36:16] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:36:16] [INFO ] Computed 137 place invariants in 23 ms
[2022-05-17 18:36:16] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:36:16] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:36:16] [INFO ] After 328ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:36:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:36:16] [INFO ] After 119ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:16] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:17] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:36:17] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2022-05-17 18:36:17] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:17] [INFO ] After 143ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:17] [INFO ] Deduced a trap composed of 251 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 227 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:36:18] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 251 places in 206 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:19] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 239 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 254 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:20] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:36:21] [INFO ] Deduced a trap composed of 257 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:36:21] [INFO ] Deduced a trap composed of 254 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:21] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:36:21] [INFO ] Deduced a trap composed of 215 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:36:22] [INFO ] Deduced a trap composed of 221 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:22] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:36:22] [INFO ] Deduced a trap composed of 254 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:36:23] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 1 ms to minimize.
[2022-05-17 18:36:23] [INFO ] Deduced a trap composed of 221 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:24] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:36:24] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:36:24] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:25] [INFO ] Deduced a trap composed of 248 places in 225 ms of which 0 ms to minimize.
[2022-05-17 18:36:25] [INFO ] Deduced a trap composed of 251 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:26] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:36:26] [INFO ] Deduced a trap composed of 239 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:36:27] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:27] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:27] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:36:36] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 19349 ms
[2022-05-17 18:36:37] [INFO ] After 19647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:36:37] [INFO ] After 20131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 23 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2022-05-17 18:36:37] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:36:37] [INFO ] Computed 137 place invariants in 23 ms
[2022-05-17 18:36:37] [INFO ] Implicit Places using invariants in 779 ms returned []
[2022-05-17 18:36:37] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:36:37] [INFO ] Computed 137 place invariants in 22 ms
[2022-05-17 18:36:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 18:36:41] [INFO ] Implicit Places using invariants and state equation in 3654 ms returned []
Implicit Place search using SMT with State Equation took 4437 ms to find 0 implicit places.
[2022-05-17 18:36:41] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-17 18:36:41] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2022-05-17 18:36:41] [INFO ] Computed 137 place invariants in 20 ms
[2022-05-17 18:36:42] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 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 770 transition count 1082
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 770 transition count 1081
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 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 91 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2022-05-17 18:36:42] [INFO ] Computed 137 place invariants in 22 ms
[2022-05-17 18:36:42] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:36:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:36:42] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2022-05-17 18:36:43] [INFO ] After 639ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:43] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:36:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2022-05-17 18:36:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:36:43] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:36:43] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 249 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 231 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:36:44] [INFO ] Deduced a trap composed of 243 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 222 places in 221 ms of which 1 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 0 ms to minimize.
[2022-05-17 18:36:45] [INFO ] Deduced a trap composed of 243 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 246 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 252 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:36:46] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 228 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:47] [INFO ] Deduced a trap composed of 237 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 237 places in 222 ms of which 0 ms to minimize.
[2022-05-17 18:36:48] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 231 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:36:49] [INFO ] Deduced a trap composed of 237 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 234 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:50] [INFO ] Deduced a trap composed of 231 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 231 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 243 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:51] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 222 places in 211 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 237 places in 206 ms of which 0 ms to minimize.
[2022-05-17 18:36:52] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 225 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 231 places in 215 ms of which 0 ms to minimize.
[2022-05-17 18:36:53] [INFO ] Deduced a trap composed of 249 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:36:54] [INFO ] Deduced a trap composed of 222 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:54] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:54] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:54] [INFO ] Deduced a trap composed of 231 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:36:55] [INFO ] Deduced a trap composed of 237 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:55] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:36:55] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 237 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 246 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:36:56] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:36:57] [INFO ] Deduced a trap composed of 225 places in 209 ms of which 0 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 249 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 207 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 225 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:36:58] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 0 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 243 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:36:59] [INFO ] Deduced a trap composed of 243 places in 209 ms of which 1 ms to minimize.
[2022-05-17 18:37:00] [INFO ] Deduced a trap composed of 237 places in 210 ms of which 0 ms to minimize.
[2022-05-17 18:37:00] [INFO ] Deduced a trap composed of 228 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:37:00] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:37:00] [INFO ] Deduced a trap composed of 237 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:37:01] [INFO ] Deduced a trap composed of 231 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 225 places in 208 ms of which 0 ms to minimize.
[2022-05-17 18:37:02] [INFO ] Deduced a trap composed of 246 places in 207 ms of which 1 ms to minimize.
[2022-05-17 18:37:03] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:37:12] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 29189 ms
[2022-05-17 18:37:13] [INFO ] After 29769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:13] [INFO ] After 29913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:37:13] [INFO ] Flatten gal took : 148 ms
[2022-05-17 18:37:13] [INFO ] Flatten gal took : 110 ms
[2022-05-17 18:37:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10901160325017724820.gal : 24 ms
[2022-05-17 18:37:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3416165569507394106.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15168771174988350417;'/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/ReachabilityCardinality10901160325017724820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3416165569507394106.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/ReachabilityCardinality3416165569507394106.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :28 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 43
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :43 after 48
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48 after 58
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58 after 72
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :72 after 153
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :153 after 2733
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2733 after 4207
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4207 after 5412
Detected timeout of ITS tools.
[2022-05-17 18:37:28] [INFO ] Flatten gal took : 83 ms
[2022-05-17 18:37:28] [INFO ] Applying decomposition
[2022-05-17 18:37:28] [INFO ] Flatten gal took : 66 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/graph16205042619248237298.txt' '-o' '/tmp/graph16205042619248237298.bin' '-w' '/tmp/graph16205042619248237298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16205042619248237298.bin' '-l' '-1' '-v' '-w' '/tmp/graph16205042619248237298.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:37:28] [INFO ] Decomposing Gal with order
[2022-05-17 18:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:37:29] [INFO ] Removed a total of 1176 redundant transitions.
[2022-05-17 18:37:29] [INFO ] Flatten gal took : 385 ms
[2022-05-17 18:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 534 labels/synchronizations in 53 ms.
[2022-05-17 18:37:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9528947424153519934.gal : 17 ms
[2022-05-17 18:37:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6303971606942674583.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15168771174988350417;'/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/ReachabilityCardinality9528947424153519934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6303971606942674583.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/ReachabilityCardinality6303971606942674583.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18440809850359053717
[2022-05-17 18:37:44] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18440809850359053717
Running compilation step : cd /tmp/ltsmin18440809850359053717;'/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 2002 ms.
Running link step : cd /tmp/ltsmin18440809850359053717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18440809850359053717;'/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 770 transition count 1082
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 770 transition count 1081
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 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 100 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2022-05-17 18:37:59] [INFO ] Computed 137 place invariants in 32 ms
[2022-05-17 18:37:59] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2022-05-17 18:37:59] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2022-05-17 18:38:00] [INFO ] After 302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 18:38:00] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2022-05-17 18:38:00] [INFO ] After 640ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:38:00] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 18:38:00] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2022-05-17 18:38:00] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-17 18:38:01] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 249 places in 221 ms of which 0 ms to minimize.
[2022-05-17 18:38:01] [INFO ] Deduced a trap composed of 231 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:38:02] [INFO ] Deduced a trap composed of 243 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:38:02] [INFO ] Deduced a trap composed of 222 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 243 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:38:03] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 252 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:38:04] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 3 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 1 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 237 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 234 places in 212 ms of which 1 ms to minimize.
[2022-05-17 18:38:05] [INFO ] Deduced a trap composed of 237 places in 236 ms of which 4 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:38:06] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 0 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:38:07] [INFO ] Deduced a trap composed of 240 places in 240 ms of which 1 ms to minimize.
[2022-05-17 18:38:08] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:38:08] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:38:08] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:38:08] [INFO ] Deduced a trap composed of 243 places in 213 ms of which 0 ms to minimize.
[2022-05-17 18:38:09] [INFO ] Deduced a trap composed of 237 places in 224 ms of which 0 ms to minimize.
[2022-05-17 18:38:09] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:38:09] [INFO ] Deduced a trap composed of 222 places in 215 ms of which 1 ms to minimize.
[2022-05-17 18:38:10] [INFO ] Deduced a trap composed of 231 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:38:10] [INFO ] Deduced a trap composed of 237 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:38:10] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 1 ms to minimize.
[2022-05-17 18:38:10] [INFO ] Deduced a trap composed of 225 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:38:11] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 0 ms to minimize.
[2022-05-17 18:38:11] [INFO ] Deduced a trap composed of 249 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:38:11] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Deduced a trap composed of 231 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:38:12] [INFO ] Deduced a trap composed of 237 places in 211 ms of which 0 ms to minimize.
[2022-05-17 18:38:13] [INFO ] Deduced a trap composed of 240 places in 230 ms of which 1 ms to minimize.
[2022-05-17 18:38:13] [INFO ] Deduced a trap composed of 225 places in 218 ms of which 0 ms to minimize.
[2022-05-17 18:38:13] [INFO ] Deduced a trap composed of 237 places in 225 ms of which 1 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 231 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 246 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 240 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:38:14] [INFO ] Deduced a trap composed of 234 places in 205 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 225 places in 210 ms of which 1 ms to minimize.
[2022-05-17 18:38:15] [INFO ] Deduced a trap composed of 249 places in 214 ms of which 0 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 207 places in 208 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 225 places in 229 ms of which 1 ms to minimize.
[2022-05-17 18:38:16] [INFO ] Deduced a trap composed of 246 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 1 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 0 ms to minimize.
[2022-05-17 18:38:17] [INFO ] Deduced a trap composed of 243 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 1 ms to minimize.
[2022-05-17 18:38:18] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 1 ms to minimize.
[2022-05-17 18:38:19] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 225 places in 216 ms of which 0 ms to minimize.
[2022-05-17 18:38:20] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 1 ms to minimize.
[2022-05-17 18:38:21] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 1 ms to minimize.
[2022-05-17 18:38:30] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 29729 ms
[2022-05-17 18:38:31] [INFO ] After 30282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:31] [INFO ] After 30429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-17 18:38:31] [INFO ] Flatten gal took : 56 ms
[2022-05-17 18:38:31] [INFO ] Flatten gal took : 54 ms
[2022-05-17 18:38:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6812522673031669436.gal : 7 ms
[2022-05-17 18:38:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7956320049758979934.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/ReachabilityCardinality6812522673031669436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7956320049758979934.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/ReachabilityCardinality7956320049758979934.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :28 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 43
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :43 after 48
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48 after 58
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58 after 72
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :72 after 153
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :153 after 2733
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2733 after 4207
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4207 after 5412
Detected timeout of ITS tools.
[2022-05-17 18:38:46] [INFO ] Flatten gal took : 55 ms
[2022-05-17 18:38:46] [INFO ] Applying decomposition
[2022-05-17 18:38:46] [INFO ] Flatten gal took : 51 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/graph17562801566191934930.txt' '-o' '/tmp/graph17562801566191934930.bin' '-w' '/tmp/graph17562801566191934930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17562801566191934930.bin' '-l' '-1' '-v' '-w' '/tmp/graph17562801566191934930.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:38:46] [INFO ] Decomposing Gal with order
[2022-05-17 18:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:38:46] [INFO ] Removed a total of 1176 redundant transitions.
[2022-05-17 18:38:46] [INFO ] Flatten gal took : 130 ms
[2022-05-17 18:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 28 ms.
[2022-05-17 18:38:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9842770251255267434.gal : 10 ms
[2022-05-17 18:38:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7765585967099860114.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/ReachabilityCardinality9842770251255267434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7765585967099860114.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/ReachabilityCardinality7765585967099860114.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.20921e+08
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.20921e+08 after 1.22686e+08
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.22686e+08 after 1.24452e+08
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24452e+08 after 1.26218e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.26218e+08 after 1.27984e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.27984e+08 after 1.36813e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.36813e+08 after 1.52705e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.52705e+08 after 1.72129e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11912345764971485294
[2022-05-17 18:39:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11912345764971485294
Running compilation step : cd /tmp/ltsmin11912345764971485294;'/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 1942 ms.
Running link step : cd /tmp/ltsmin11912345764971485294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11912345764971485294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:39:16] [INFO ] Flatten gal took : 48 ms
[2022-05-17 18:39:16] [INFO ] Flatten gal took : 50 ms
[2022-05-17 18:39:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17743843654844518333.gal : 5 ms
[2022-05-17 18:39:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5953857954107769252.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/ReachabilityFireability17743843654844518333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5953857954107769252.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/ReachabilityFireability5953857954107769252.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 38
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 56
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :56 after 1625
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1625 after 1821
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1821 after 2445
Detected timeout of ITS tools.
[2022-05-17 18:39:20] [INFO ] Flatten gal took : 46 ms
[2022-05-17 18:39:20] [INFO ] Applying decomposition
[2022-05-17 18:39:20] [INFO ] Flatten gal took : 45 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/graph2132411228678610573.txt' '-o' '/tmp/graph2132411228678610573.bin' '-w' '/tmp/graph2132411228678610573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2132411228678610573.bin' '-l' '-1' '-v' '-w' '/tmp/graph2132411228678610573.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:39:20] [INFO ] Decomposing Gal with order
[2022-05-17 18:39:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:39:20] [INFO ] Removed a total of 1084 redundant transitions.
[2022-05-17 18:39:20] [INFO ] Flatten gal took : 107 ms
[2022-05-17 18:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 305 labels/synchronizations in 26 ms.
[2022-05-17 18:39:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4142772093239297819.gal : 8 ms
[2022-05-17 18:39:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6312903230117897639.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/ReachabilityFireability4142772093239297819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6312903230117897639.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/ReachabilityFireability6312903230117897639.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 2145
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2145 after 2987
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2987 after 3954
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11423337182563398829
[2022-05-17 18:39:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11423337182563398829
Running compilation step : cd /tmp/ltsmin11423337182563398829;'/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 1951 ms.
Running link step : cd /tmp/ltsmin11423337182563398829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11423337182563398829;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:39:26] [INFO ] Flatten gal took : 44 ms
[2022-05-17 18:39:26] [INFO ] Flatten gal took : 44 ms
[2022-05-17 18:39:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13066875724125852732.gal : 5 ms
[2022-05-17 18:39:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4393383861080658815.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/ReachabilityFireability13066875724125852732.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4393383861080658815.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/ReachabilityFireability4393383861080658815.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 38
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 56
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :56 after 1625
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1625 after 1821
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1821 after 2445
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2445 after 3259
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3259 after 5236
Detected timeout of ITS tools.
[2022-05-17 18:39:56] [INFO ] Flatten gal took : 55 ms
[2022-05-17 18:39:56] [INFO ] Applying decomposition
[2022-05-17 18:39:56] [INFO ] Flatten gal took : 42 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/graph11009684671351979029.txt' '-o' '/tmp/graph11009684671351979029.bin' '-w' '/tmp/graph11009684671351979029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11009684671351979029.bin' '-l' '-1' '-v' '-w' '/tmp/graph11009684671351979029.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:39:56] [INFO ] Decomposing Gal with order
[2022-05-17 18:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:39:57] [INFO ] Removed a total of 1084 redundant transitions.
[2022-05-17 18:39:57] [INFO ] Flatten gal took : 198 ms
[2022-05-17 18:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 497 labels/synchronizations in 30 ms.
[2022-05-17 18:39:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8224927425603988146.gal : 10 ms
[2022-05-17 18:39:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13013116774473444902.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/ReachabilityFireability8224927425603988146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13013116774473444902.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/ReachabilityFireability13013116774473444902.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 3117
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3117 after 7934
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8057056790558676090
[2022-05-17 18:40:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8057056790558676090
Running compilation step : cd /tmp/ltsmin8057056790558676090;'/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 1999 ms.
Running link step : cd /tmp/ltsmin8057056790558676090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8057056790558676090;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 18:40:57] [INFO ] Flatten gal took : 42 ms
[2022-05-17 18:40:57] [INFO ] Flatten gal took : 41 ms
[2022-05-17 18:40:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15972068163874942561.gal : 5 ms
[2022-05-17 18:40:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12810221443562542811.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/ReachabilityFireability15972068163874942561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12810221443562542811.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/ReachabilityFireability12810221443562542811.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 38
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 56
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :56 after 1625
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1625 after 1821
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1821 after 2445
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2445 after 3259
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3259 after 5236
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5236 after 11441
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :11441 after 193110
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :193110 after 324498
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :324498 after 594380
Detected timeout of ITS tools.
[2022-05-17 18:45:57] [INFO ] Flatten gal took : 45 ms
[2022-05-17 18:45:57] [INFO ] Applying decomposition
[2022-05-17 18:45:57] [INFO ] Flatten gal took : 43 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/graph15727323781790969471.txt' '-o' '/tmp/graph15727323781790969471.bin' '-w' '/tmp/graph15727323781790969471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15727323781790969471.bin' '-l' '-1' '-v' '-w' '/tmp/graph15727323781790969471.weights' '-q' '0' '-e' '0.001'
[2022-05-17 18:45:57] [INFO ] Decomposing Gal with order
[2022-05-17 18:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 18:45:57] [INFO ] Removed a total of 1237 redundant transitions.
[2022-05-17 18:45:57] [INFO ] Flatten gal took : 104 ms
[2022-05-17 18:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 358 labels/synchronizations in 13 ms.
[2022-05-17 18:45:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4834726850428137702.gal : 8 ms
[2022-05-17 18:45:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9353307974395125926.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/ReachabilityFireability4834726850428137702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9353307974395125926.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/ReachabilityFireability9353307974395125926.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20106
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20106 after 20107
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20107 after 5.83488e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5.83488e+07 after 5.83488e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.83488e+07 after 5.83494e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5.83494e+07 after 5.83494e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.83494e+07 after 5.83495e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.83495e+07 after 5.83496e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.83496e+07 after 5.83498e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.83498e+07 after 5.83541e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.83541e+07 after 5.83611e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.83611e+07 after 5.83674e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10256318649380556006
[2022-05-17 18:50:58] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10256318649380556006
Running compilation step : cd /tmp/ltsmin10256318649380556006;'/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 1911 ms.
Running link step : cd /tmp/ltsmin10256318649380556006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10256318649380556006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.030: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.030: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.028: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.030: There are 1087 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.030: State length is 770, there are 1086 groups
pins2lts-mc-linux64( 0/ 8), 0.030: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.030: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.030: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.030: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.029: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.029: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.029: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.029: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.077: ~6 levels ~960 states ~4832 transitions
pins2lts-mc-linux64( 5/ 8), 0.149: ~1 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 5/ 8), 0.266: ~3 levels ~3840 states ~5952 transitions
pins2lts-mc-linux64( 5/ 8), 0.461: ~4 levels ~7680 states ~22544 transitions
pins2lts-mc-linux64( 5/ 8), 0.765: ~5 levels ~15360 states ~51224 transitions
pins2lts-mc-linux64( 5/ 8), 1.341: ~6 levels ~30720 states ~101008 transitions
pins2lts-mc-linux64( 3/ 8), 2.652: ~3 levels ~61440 states ~282496 transitions
pins2lts-mc-linux64( 3/ 8), 4.554: ~4 levels ~122880 states ~464624 transitions
pins2lts-mc-linux64( 3/ 8), 7.924: ~5 levels ~245760 states ~747784 transitions
pins2lts-mc-linux64( 3/ 8), 14.546: ~6 levels ~491520 states ~1051144 transitions
pins2lts-mc-linux64( 3/ 8), 27.982: ~10 levels ~983040 states ~2283040 transitions
pins2lts-mc-linux64( 7/ 8), 54.850: ~26 levels ~1966080 states ~4502232 transitions
pins2lts-mc-linux64( 3/ 8), 101.943: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 103.038:
pins2lts-mc-linux64( 0/ 8), 103.038: mean standard work distribution: 22.7% (states) 74.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 103.038:
pins2lts-mc-linux64( 0/ 8), 103.038: Explored 2937963 states 42144925 transitions, fanout: 14.345
pins2lts-mc-linux64( 0/ 8), 103.038: Total exploration time 103.010 sec (101.920 sec minimum, 102.076 sec on average)
pins2lts-mc-linux64( 0/ 8), 103.038: States per second: 28521, Transitions per second: 409134
pins2lts-mc-linux64( 0/ 8), 103.038:
pins2lts-mc-linux64( 0/ 8), 103.038: Queue width: 8B, total height: 14135290, memory: 107.84MB
pins2lts-mc-linux64( 0/ 8), 103.038: Tree memory: 386.3MB, 23.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 103.038: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 103.038: Stored 1156 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 103.038: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 103.038: Est. total memory use: 494.1MB (~1131.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10256318649380556006;'/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/ltsmin10256318649380556006;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 18:52:43] [INFO ] Flatten gal took : 44 ms
[2022-05-17 18:52:43] [INFO ] Flatten gal took : 43 ms
[2022-05-17 18:52:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6122460431197336424.gal : 5 ms
[2022-05-17 18:52:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10381386863611974685.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/ReachabilityFireability6122460431197336424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10381386863611974685.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/ReachabilityFireability10381386863611974685.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 38
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 56
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :56 after 1625
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1625 after 1821
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1821 after 2445
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2445 after 3259
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3259 after 5236
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5236 after 11441
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :11441 after 193110
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :193110 after 324498
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :324498 after 594380

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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