Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678871767465

Running Version 202205111006
[2023-03-15 09:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:16:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 09:16:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:16:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 679 ms
[2023-03-15 09:16:09] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 24 ms.
[2023-03-15 09:16:09] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 61 ms.
[2023-03-15 09:16:09] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:16:09] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 09:16:09] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 09:16:09] [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 702 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 09:16:10] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-15 09:16:10] [INFO ] Computed 142 place invariants in 125 ms
[2023-03-15 09:16:10] [INFO ] [Real]Absence check using 135 positive place invariants in 47 ms returned sat
[2023-03-15 09:16:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:16:10] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 51 ms returned sat
[2023-03-15 09:16:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 82 ms returned sat
[2023-03-15 09:16:12] [INFO ] After 1299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:12] [INFO ] After 400ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:13] [INFO ] Deduced a trap composed of 507 places in 366 ms of which 4 ms to minimize.
[2023-03-15 09:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2023-03-15 09:16:13] [INFO ] After 1009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-15 09:16:13] [INFO ] After 2680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 267 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
[2023-03-15 09:16:13] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2023-03-15 09:16:13] [INFO ] Computed 137 place invariants in 73 ms
[2023-03-15 09:16:14] [INFO ] Dead Transitions using invariants and state equation in 994 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 : 770/909 places, 1086/1315 transitions.
Applied a total of 0 rules in 52 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 770/909 places, 1086/1315 transitions.
Incomplete random walk after 1000000 steps, including 52020 resets, run finished after 5379 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3385 resets, run finished after 1302 ms. (steps per millisecond=768 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2178928 steps, run timeout after 18001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 2178928 steps, saw 677196 distinct states, run finished after 18002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:16:39] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:16:39] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 09:16:39] [INFO ] [Real]Absence check using 130 positive place invariants in 29 ms returned sat
[2023-03-15 09:16:39] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:16:40] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:40] [INFO ] After 124ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:40] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:40] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 09:16:40] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:16:40] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:41] [INFO ] After 327ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:41] [INFO ] Deduced a trap composed of 254 places in 231 ms of which 1 ms to minimize.
[2023-03-15 09:16:41] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 2 ms to minimize.
[2023-03-15 09:16:41] [INFO ] Deduced a trap composed of 248 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:16:42] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 1 ms to minimize.
[2023-03-15 09:16:42] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 1 ms to minimize.
[2023-03-15 09:16:42] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 1 ms to minimize.
[2023-03-15 09:16:43] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-15 09:16:43] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:16:43] [INFO ] Deduced a trap composed of 221 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:16:43] [INFO ] Deduced a trap composed of 245 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:16:44] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:16:44] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 1 ms to minimize.
[2023-03-15 09:16:44] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 0 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 233 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:16:46] [INFO ] Deduced a trap composed of 242 places in 244 ms of which 1 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 221 places in 245 ms of which 0 ms to minimize.
[2023-03-15 09:16:47] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 0 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 218 places in 250 ms of which 0 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 1 ms to minimize.
[2023-03-15 09:16:48] [INFO ] Deduced a trap composed of 248 places in 233 ms of which 1 ms to minimize.
[2023-03-15 09:16:49] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:16:49] [INFO ] Deduced a trap composed of 227 places in 241 ms of which 1 ms to minimize.
[2023-03-15 09:16:49] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 251 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:16:50] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 239 places in 229 ms of which 0 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 260 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:16:51] [INFO ] Deduced a trap composed of 254 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:16:52] [INFO ] Deduced a trap composed of 221 places in 219 ms of which 3 ms to minimize.
[2023-03-15 09:16:52] [INFO ] Deduced a trap composed of 257 places in 251 ms of which 1 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 1 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-15 09:16:53] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 2 ms to minimize.
[2023-03-15 09:16:54] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:16:56] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:16:57] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:16:57] [INFO ] Deduced a trap composed of 257 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:16:58] [INFO ] Deduced a trap composed of 233 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:16:58] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:16:58] [INFO ] Deduced a trap composed of 251 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:17:00] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 1 ms to minimize.
[2023-03-15 09:17:01] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 2 ms to minimize.
[2023-03-15 09:17:06] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:17:11] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 0 ms to minimize.
[2023-03-15 09:17:15] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:17:24] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 43561 ms
[2023-03-15 09:17:24] [INFO ] After 43975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:17:24] [INFO ] After 44453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 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 38 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 33 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 09:17:24] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:17:24] [INFO ] Computed 137 place invariants in 37 ms
[2023-03-15 09:17:25] [INFO ] Implicit Places using invariants in 841 ms returned []
[2023-03-15 09:17:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:17:25] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 09:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:30] [INFO ] Implicit Places using invariants and state equation in 4997 ms returned []
Implicit Place search using SMT with State Equation took 5840 ms to find 0 implicit places.
[2023-03-15 09:17:30] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-15 09:17:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:17:30] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-15 09:17:31] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100002 steps, including 5121 resets, run finished after 659 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:32] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:17:32] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-15 09:17:32] [INFO ] [Real]Absence check using 130 positive place invariants in 41 ms returned sat
[2023-03-15 09:17:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:17:32] [INFO ] After 354ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:17:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:32] [INFO ] After 129ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:32] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 27 ms returned sat
[2023-03-15 09:17:32] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:17:33] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:33] [INFO ] After 343ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 254 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 7 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 233 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 239 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 239 places in 229 ms of which 1 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 221 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 2 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:17:37] [INFO ] Deduced a trap composed of 248 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:17:37] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:17:38] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 1 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 1 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 218 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 248 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:17:41] [INFO ] Deduced a trap composed of 248 places in 237 ms of which 0 ms to minimize.
[2023-03-15 09:17:41] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 1 ms to minimize.
[2023-03-15 09:17:41] [INFO ] Deduced a trap composed of 227 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 239 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 251 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 239 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 260 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 254 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 221 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:17:44] [INFO ] Deduced a trap composed of 257 places in 226 ms of which 0 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 245 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 230 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:17:49] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 257 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 233 places in 292 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 242 places in 304 ms of which 1 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 251 places in 306 ms of which 1 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 1 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:17:59] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:18:03] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:18:08] [INFO ] Deduced a trap composed of 245 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:18:17] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 43829 ms
[2023-03-15 09:18:17] [INFO ] After 44356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:17] [INFO ] After 44883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52078 resets, run finished after 5147 ms. (steps per millisecond=194 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3490 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2187876 steps, run timeout after 18001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 2187876 steps, saw 680123 distinct states, run finished after 18001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:18:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:18:42] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-15 09:18:42] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 09:18:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:18:42] [INFO ] After 334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:18:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:18:42] [INFO ] After 126ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:42] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:18:42] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 09:18:42] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:18:43] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:43] [INFO ] After 330ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:18:43] [INFO ] Deduced a trap composed of 254 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 242 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 1 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:18:44] [INFO ] Deduced a trap composed of 233 places in 236 ms of which 0 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 221 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 245 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 248 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:18:47] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:18:48] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:18:49] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:18:49] [INFO ] Deduced a trap composed of 251 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:18:49] [INFO ] Deduced a trap composed of 221 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:18:49] [INFO ] Deduced a trap composed of 236 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 1 ms to minimize.
[2023-03-15 09:18:50] [INFO ] Deduced a trap composed of 248 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 242 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 227 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:18:51] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 251 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 239 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:18:52] [INFO ] Deduced a trap composed of 239 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:18:53] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:18:53] [INFO ] Deduced a trap composed of 260 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:18:53] [INFO ] Deduced a trap composed of 254 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:18:54] [INFO ] Deduced a trap composed of 221 places in 223 ms of which 5 ms to minimize.
[2023-03-15 09:18:54] [INFO ] Deduced a trap composed of 257 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:18:54] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 236 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Deduced a trap composed of 245 places in 225 ms of which 0 ms to minimize.
[2023-03-15 09:18:56] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 0 ms to minimize.
[2023-03-15 09:18:57] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:18:58] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 257 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:18:59] [INFO ] Deduced a trap composed of 233 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:19:00] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:19:02] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:19:03] [INFO ] Deduced a trap composed of 239 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 233 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 42875 ms
[2023-03-15 09:19:26] [INFO ] After 43385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:19:26] [INFO ] After 43860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 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 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 09:19:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:19:26] [INFO ] Computed 137 place invariants in 16 ms
[2023-03-15 09:19:27] [INFO ] Implicit Places using invariants in 795 ms returned []
[2023-03-15 09:19:27] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:19:27] [INFO ] Computed 137 place invariants in 21 ms
[2023-03-15 09:19:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:30] [INFO ] Implicit Places using invariants and state equation in 3446 ms returned []
Implicit Place search using SMT with State Equation took 4243 ms to find 0 implicit places.
[2023-03-15 09:19:30] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 09:19:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:19:31] [INFO ] Computed 137 place invariants in 15 ms
[2023-03-15 09:19:31] [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 5256 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:19:32] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:19:32] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 09:19:32] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 09:19:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:19:32] [INFO ] After 340ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:19:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:32] [INFO ] After 126ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:32] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 09:19:33] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:19:33] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:33] [INFO ] After 344ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 254 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 248 places in 229 ms of which 0 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 233 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 0 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 239 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 221 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 245 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 221 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 218 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 248 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:19:40] [INFO ] Deduced a trap composed of 248 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 227 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 239 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 251 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:19:42] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 0 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 239 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 260 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:19:43] [INFO ] Deduced a trap composed of 254 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 221 places in 239 ms of which 0 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 257 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 245 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:19:45] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:19:45] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 245 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:19:47] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:48] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 257 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:19:50] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:19:50] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 239 places in 233 ms of which 1 ms to minimize.
[2023-03-15 09:19:58] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:20:03] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:20:07] [INFO ] Deduced a trap composed of 245 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:20:16] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 42904 ms
[2023-03-15 09:20:16] [INFO ] After 43341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:16] [INFO ] After 43817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 534 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355687 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355687 steps, saw 108203 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:20:19] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:20:19] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 09:20:19] [INFO ] [Real]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 09:20:19] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:20:20] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:20:20] [INFO ] After 114ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:20] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:20] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 09:20:20] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:20:20] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:21] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:21] [INFO ] Deduced a trap composed of 254 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:20:21] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:20:21] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:20:22] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:20:22] [INFO ] Deduced a trap composed of 248 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:20:22] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:20:22] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:20:23] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:20:23] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:20:23] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 239 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:20:25] [INFO ] Deduced a trap composed of 239 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:20:25] [INFO ] Deduced a trap composed of 245 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:20:25] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:20:26] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:20:26] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:20:27] [INFO ] Deduced a trap composed of 233 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:20:27] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:20:27] [INFO ] Deduced a trap composed of 248 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:20:28] [INFO ] Deduced a trap composed of 251 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:20:37] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 16316 ms
[2023-03-15 09:20:37] [INFO ] After 16522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:37] [INFO ] After 17004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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 35 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 09:20:37] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:20:37] [INFO ] Computed 137 place invariants in 16 ms
[2023-03-15 09:20:38] [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.
Incomplete random walk after 10000 steps, including 555 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355079 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355079 steps, saw 108021 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:20:41] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:20:41] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 09:20:41] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 09:20:41] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:20:41] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:20:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:20:41] [INFO ] After 114ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:41] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:20:41] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 09:20:41] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:20:42] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:42] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:20:42] [INFO ] Deduced a trap composed of 254 places in 232 ms of which 0 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 0 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:20:43] [INFO ] Deduced a trap composed of 248 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 239 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:20:44] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 245 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:20:45] [INFO ] Deduced a trap composed of 239 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:20:46] [INFO ] Deduced a trap composed of 239 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 245 places in 223 ms of which 0 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:20:47] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 1 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 248 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:20:48] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 248 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:20:49] [INFO ] Deduced a trap composed of 251 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:20:58] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 16462 ms
[2023-03-15 09:20:59] [INFO ] After 16666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:59] [INFO ] After 17143ms 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 28 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 26 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 09:20:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:20:59] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-15 09:20:59] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-15 09:20:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:20:59] [INFO ] Computed 137 place invariants in 16 ms
[2023-03-15 09:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:21:04] [INFO ] Implicit Places using invariants and state equation in 4980 ms returned []
Implicit Place search using SMT with State Equation took 5776 ms to find 0 implicit places.
[2023-03-15 09:21:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 09:21:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 09:21:04] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-15 09:21:05] [INFO ] Dead Transitions using invariants and state equation in 708 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 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 106 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
[2023-03-15 09:21:05] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-15 09:21:05] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-15 09:21:05] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:21:06] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:21:06] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-15 09:21:06] [INFO ] After 645ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:21:06] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:21:06] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 09:21:06] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:21:07] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 2 ms to minimize.
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 249 places in 227 ms of which 1 ms to minimize.
[2023-03-15 09:21:07] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 243 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 225 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:08] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 225 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:21:09] [INFO ] Deduced a trap composed of 249 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 237 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 243 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 246 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:10] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 243 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 231 places in 232 ms of which 1 ms to minimize.
[2023-03-15 09:21:11] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 241 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 243 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-15 09:21:12] [INFO ] Deduced a trap composed of 255 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 243 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 240 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 216 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 240 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 231 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 225 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 231 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 225 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 240 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:21:17] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:21:17] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:21:17] [INFO ] Deduced a trap composed of 255 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 237 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 243 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 255 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 231 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 234 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:21:20] [INFO ] Deduced a trap composed of 246 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:21:20] [INFO ] Deduced a trap composed of 234 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:21:20] [INFO ] Deduced a trap composed of 228 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 237 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 243 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 243 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 231 places in 206 ms of which 0 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:24] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:21:24] [INFO ] Deduced a trap composed of 240 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 234 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 234 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:21:26] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:21:26] [INFO ] Deduced a trap composed of 225 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:26] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:27] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:21:27] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:21:27] [INFO ] Deduced a trap composed of 237 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:21:28] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:21:28] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:29] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:30] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:31] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:21:31] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:21:32] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:21:33] [INFO ] Deduced a trap composed of 219 places in 208 ms of which 0 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 240 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:21:35] [INFO ] Deduced a trap composed of 231 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:21:35] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:35] [INFO ] Deduced a trap composed of 249 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:35] [INFO ] Deduced a trap composed of 243 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:36] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:21:36] [INFO ] Deduced a trap composed of 252 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:36] [INFO ] Deduced a trap composed of 222 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:36] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:21:37] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:21:37] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 231 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 219 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 240 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 231 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 231 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:21:47] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:21:50] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 243 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 243 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 243 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 231 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 252 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 222 places in 208 ms of which 1 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:21:58] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 228 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:22:00] [INFO ] Deduced a trap composed of 219 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:22:01] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:22:10] [INFO ] Trap strengthening (SAT) tested/added 127/127 trap constraints in 63877 ms
[2023-03-15 09:22:10] [INFO ] After 64303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:10] [INFO ] After 64449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:11] [INFO ] Flatten gal took : 199 ms
[2023-03-15 09:22:11] [INFO ] Flatten gal took : 116 ms
[2023-03-15 09:22:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15898930851270327890.gal : 46 ms
[2023-03-15 09:22:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18409709975416583435.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10156730446100213421;'/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/ReachabilityCardinality15898930851270327890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18409709975416583435.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/ReachabilityCardinality18409709975416583435.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.
[2023-03-15 09:22:26] [INFO ] Flatten gal took : 92 ms
[2023-03-15 09:22:26] [INFO ] Applying decomposition
[2023-03-15 09:22:26] [INFO ] Flatten gal took : 104 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/graph6549370613466671545.txt' '-o' '/tmp/graph6549370613466671545.bin' '-w' '/tmp/graph6549370613466671545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6549370613466671545.bin' '-l' '-1' '-v' '-w' '/tmp/graph6549370613466671545.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:22:27] [INFO ] Decomposing Gal with order
[2023-03-15 09:22:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:22:27] [INFO ] Removed a total of 1176 redundant transitions.
[2023-03-15 09:22:27] [INFO ] Flatten gal took : 410 ms
[2023-03-15 09:22:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 48 ms.
[2023-03-15 09:22:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3391968489309960300.gal : 28 ms
[2023-03-15 09:22:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9706449492112247342.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10156730446100213421;'/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/ReachabilityCardinality3391968489309960300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9706449492112247342.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/ReachabilityCardinality9706449492112247342.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2.08219e+08
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2.08219e+08 after 2.08219e+08
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2.08219e+08 after 2.0822e+08
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.0822e+08 after 2.0822e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.0822e+08 after 2.08221e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.08221e+08 after 2.08222e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16119665147916685676
[2023-03-15 09:22:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16119665147916685676
Running compilation step : cd /tmp/ltsmin16119665147916685676;'/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 1993 ms.
Running link step : cd /tmp/ltsmin16119665147916685676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16119665147916685676;'/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 110 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
[2023-03-15 09:22:58] [INFO ] Computed 137 place invariants in 15 ms
[2023-03-15 09:22:58] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-15 09:22:58] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:22:58] [INFO ] After 310ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:22:58] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 1 ms to minimize.
[2023-03-15 09:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 09:22:58] [INFO ] After 664ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:22:58] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:22:58] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 09:22:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:22:59] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:22:59] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 1 ms to minimize.
[2023-03-15 09:22:59] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:23:00] [INFO ] Deduced a trap composed of 231 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:23:00] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 0 ms to minimize.
[2023-03-15 09:23:00] [INFO ] Deduced a trap composed of 225 places in 242 ms of which 1 ms to minimize.
[2023-03-15 09:23:01] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:01] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:23:01] [INFO ] Deduced a trap composed of 225 places in 244 ms of which 1 ms to minimize.
[2023-03-15 09:23:02] [INFO ] Deduced a trap composed of 249 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:02] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:23:02] [INFO ] Deduced a trap composed of 243 places in 239 ms of which 1 ms to minimize.
[2023-03-15 09:23:03] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 3 ms to minimize.
[2023-03-15 09:23:03] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 1 ms to minimize.
[2023-03-15 09:23:03] [INFO ] Deduced a trap composed of 243 places in 239 ms of which 1 ms to minimize.
[2023-03-15 09:23:04] [INFO ] Deduced a trap composed of 231 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:23:04] [INFO ] Deduced a trap composed of 249 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:04] [INFO ] Deduced a trap composed of 241 places in 228 ms of which 0 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 243 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 255 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 243 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:23:06] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 1 ms to minimize.
[2023-03-15 09:23:06] [INFO ] Deduced a trap composed of 216 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:23:06] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 225 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 240 places in 240 ms of which 0 ms to minimize.
[2023-03-15 09:23:08] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:08] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:23:08] [INFO ] Deduced a trap composed of 225 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:23:09] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:23:09] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 1 ms to minimize.
[2023-03-15 09:23:09] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2023-03-15 09:23:10] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:10] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:23:10] [INFO ] Deduced a trap composed of 255 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 243 places in 210 ms of which 0 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 0 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 255 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 231 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:13] [INFO ] Deduced a trap composed of 246 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:23:13] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 1 ms to minimize.
[2023-03-15 09:23:13] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 0 ms to minimize.
[2023-03-15 09:23:14] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 1 ms to minimize.
[2023-03-15 09:23:14] [INFO ] Deduced a trap composed of 231 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:23:14] [INFO ] Deduced a trap composed of 240 places in 231 ms of which 1 ms to minimize.
[2023-03-15 09:23:15] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 1 ms to minimize.
[2023-03-15 09:23:15] [INFO ] Deduced a trap composed of 243 places in 233 ms of which 1 ms to minimize.
[2023-03-15 09:23:16] [INFO ] Deduced a trap composed of 231 places in 236 ms of which 0 ms to minimize.
[2023-03-15 09:23:16] [INFO ] Deduced a trap composed of 231 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:23:17] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 1 ms to minimize.
[2023-03-15 09:23:17] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:23:18] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:18] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:23:18] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 1 ms to minimize.
[2023-03-15 09:23:19] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:19] [INFO ] Deduced a trap composed of 225 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:23:20] [INFO ] Deduced a trap composed of 243 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:23:20] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:20] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:23:21] [INFO ] Deduced a trap composed of 237 places in 211 ms of which 1 ms to minimize.
[2023-03-15 09:23:21] [INFO ] Deduced a trap composed of 240 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:21] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:22] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:23:23] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 0 ms to minimize.
[2023-03-15 09:23:24] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:23:25] [INFO ] Deduced a trap composed of 243 places in 212 ms of which 0 ms to minimize.
[2023-03-15 09:23:25] [INFO ] Deduced a trap composed of 240 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 219 places in 223 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:23:28] [INFO ] Deduced a trap composed of 231 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:28] [INFO ] Deduced a trap composed of 225 places in 220 ms of which 0 ms to minimize.
[2023-03-15 09:23:28] [INFO ] Deduced a trap composed of 249 places in 215 ms of which 1 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 252 places in 228 ms of which 1 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 222 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:23:30] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:30] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:31] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 1 ms to minimize.
[2023-03-15 09:23:31] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:23:31] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 1 ms to minimize.
[2023-03-15 09:23:32] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 1 ms to minimize.
[2023-03-15 09:23:32] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 0 ms to minimize.
[2023-03-15 09:23:33] [INFO ] Deduced a trap composed of 219 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:34] [INFO ] Deduced a trap composed of 249 places in 225 ms of which 1 ms to minimize.
[2023-03-15 09:23:34] [INFO ] Deduced a trap composed of 240 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:23:34] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 1 ms to minimize.
[2023-03-15 09:23:35] [INFO ] Deduced a trap composed of 231 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:23:35] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 1 ms to minimize.
[2023-03-15 09:23:35] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 1 ms to minimize.
[2023-03-15 09:23:36] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:23:36] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 0 ms to minimize.
[2023-03-15 09:23:37] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:23:37] [INFO ] Deduced a trap composed of 240 places in 221 ms of which 1 ms to minimize.
[2023-03-15 09:23:38] [INFO ] Deduced a trap composed of 240 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:23:39] [INFO ] Deduced a trap composed of 231 places in 224 ms of which 1 ms to minimize.
[2023-03-15 09:23:39] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:40] [INFO ] Deduced a trap composed of 225 places in 224 ms of which 0 ms to minimize.
[2023-03-15 09:23:44] [INFO ] Deduced a trap composed of 237 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:44] [INFO ] Deduced a trap composed of 240 places in 225 ms of which 0 ms to minimize.
[2023-03-15 09:23:45] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 1 ms to minimize.
[2023-03-15 09:23:45] [INFO ] Deduced a trap composed of 240 places in 209 ms of which 0 ms to minimize.
[2023-03-15 09:23:46] [INFO ] Deduced a trap composed of 237 places in 221 ms of which 0 ms to minimize.
[2023-03-15 09:23:46] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:23:46] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 0 ms to minimize.
[2023-03-15 09:23:47] [INFO ] Deduced a trap composed of 237 places in 219 ms of which 1 ms to minimize.
[2023-03-15 09:23:47] [INFO ] Deduced a trap composed of 243 places in 218 ms of which 1 ms to minimize.
[2023-03-15 09:23:47] [INFO ] Deduced a trap composed of 231 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:48] [INFO ] Deduced a trap composed of 252 places in 211 ms of which 0 ms to minimize.
[2023-03-15 09:23:49] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 0 ms to minimize.
[2023-03-15 09:23:50] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 0 ms to minimize.
[2023-03-15 09:23:50] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 0 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 0 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 1 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 1 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 1 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 1 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 219 places in 209 ms of which 1 ms to minimize.
[2023-03-15 09:23:55] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 0 ms to minimize.
[2023-03-15 09:24:04] [INFO ] Trap strengthening (SAT) tested/added 127/127 trap constraints in 65016 ms
[2023-03-15 09:24:04] [INFO ] After 65455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:24:04] [INFO ] After 65601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:24:04] [INFO ] Flatten gal took : 68 ms
[2023-03-15 09:24:04] [INFO ] Flatten gal took : 52 ms
[2023-03-15 09:24:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8063235951440860216.gal : 7 ms
[2023-03-15 09:24:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10066917800516874288.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/ReachabilityCardinality8063235951440860216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10066917800516874288.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/ReachabilityCardinality10066917800516874288.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.
[2023-03-15 09:24:19] [INFO ] Flatten gal took : 53 ms
[2023-03-15 09:24:19] [INFO ] Applying decomposition
[2023-03-15 09:24:19] [INFO ] Flatten gal took : 53 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/graph2051084989659234854.txt' '-o' '/tmp/graph2051084989659234854.bin' '-w' '/tmp/graph2051084989659234854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2051084989659234854.bin' '-l' '-1' '-v' '-w' '/tmp/graph2051084989659234854.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:24:19] [INFO ] Decomposing Gal with order
[2023-03-15 09:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:24:20] [INFO ] Removed a total of 1368 redundant transitions.
[2023-03-15 09:24:20] [INFO ] Flatten gal took : 148 ms
[2023-03-15 09:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 34 ms.
[2023-03-15 09:24:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9600078954292147152.gal : 27 ms
[2023-03-15 09:24:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3779026120103227241.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/ReachabilityCardinality9600078954292147152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3779026120103227241.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/ReachabilityCardinality3779026120103227241.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.78912e+08
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.78912e+08 after 1.78912e+08
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.78912e+08 after 1.78913e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8381579845938748073
[2023-03-15 09:24:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8381579845938748073
Running compilation step : cd /tmp/ltsmin8381579845938748073;'/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 1917 ms.
Running link step : cd /tmp/ltsmin8381579845938748073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8381579845938748073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:24:50] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:24:50] [INFO ] Flatten gal took : 45 ms
[2023-03-15 09:24:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5392443745819542066.gal : 5 ms
[2023-03-15 09:24:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7236979796660066123.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/ReachabilityFireability5392443745819542066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7236979796660066123.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/ReachabilityFireability7236979796660066123.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.
[2023-03-15 09:24:53] [INFO ] Flatten gal took : 41 ms
[2023-03-15 09:24:53] [INFO ] Applying decomposition
[2023-03-15 09:24:53] [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/graph17129805824449566395.txt' '-o' '/tmp/graph17129805824449566395.bin' '-w' '/tmp/graph17129805824449566395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17129805824449566395.bin' '-l' '-1' '-v' '-w' '/tmp/graph17129805824449566395.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:24:53] [INFO ] Decomposing Gal with order
[2023-03-15 09:24:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:24:53] [INFO ] Removed a total of 1084 redundant transitions.
[2023-03-15 09:24:53] [INFO ] Flatten gal took : 200 ms
[2023-03-15 09:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 40 ms.
[2023-03-15 09:24:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9740903928054342047.gal : 8 ms
[2023-03-15 09:24:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14909207765810751878.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/ReachabilityFireability9740903928054342047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14909207765810751878.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/ReachabilityFireability14909207765810751878.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 17723
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17723 after 36058
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36058 after 55827
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55827 after 553665
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2105329507006478593
[2023-03-15 09:24:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2105329507006478593
Running compilation step : cd /tmp/ltsmin2105329507006478593;'/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 1964 ms.
Running link step : cd /tmp/ltsmin2105329507006478593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2105329507006478593;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:25:00] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:25:00] [INFO ] Flatten gal took : 43 ms
[2023-03-15 09:25:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9962435668939286028.gal : 7 ms
[2023-03-15 09:25:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15417167912893617118.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/ReachabilityFireability9962435668939286028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15417167912893617118.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/ReachabilityFireability15417167912893617118.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.
[2023-03-15 09:25:30] [INFO ] Flatten gal took : 44 ms
[2023-03-15 09:25:30] [INFO ] Applying decomposition
[2023-03-15 09:25:30] [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/graph2447548347521510909.txt' '-o' '/tmp/graph2447548347521510909.bin' '-w' '/tmp/graph2447548347521510909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2447548347521510909.bin' '-l' '-1' '-v' '-w' '/tmp/graph2447548347521510909.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:25:30] [INFO ] Decomposing Gal with order
[2023-03-15 09:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:25:30] [INFO ] Removed a total of 1272 redundant transitions.
[2023-03-15 09:25:30] [INFO ] Flatten gal took : 145 ms
[2023-03-15 09:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 18 ms.
[2023-03-15 09:25:30] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3599101250440742822.gal : 35 ms
[2023-03-15 09:25:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5013843005770750276.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/ReachabilityFireability3599101250440742822.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5013843005770750276.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/ReachabilityFireability5013843005770750276.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 22075
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22075 after 44085
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44085 after 640769
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :640769 after 665221
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :665221 after 1.83827e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.83827e+06 after 1.00037e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.00037e+08 after 1.00038e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.00038e+08 after 1.00039e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.00039e+08 after 1.00041e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.00041e+08 after 1.22053e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9816035106774999552
[2023-03-15 09:26:00] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9816035106774999552
Running compilation step : cd /tmp/ltsmin9816035106774999552;'/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 2053 ms.
Running link step : cd /tmp/ltsmin9816035106774999552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9816035106774999552;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 09:26:30] [INFO ] Flatten gal took : 53 ms
[2023-03-15 09:26:31] [INFO ] Flatten gal took : 41 ms
[2023-03-15 09:26:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2719637153317320741.gal : 5 ms
[2023-03-15 09:26:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16153296004990058122.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/ReachabilityFireability2719637153317320741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16153296004990058122.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/ReachabilityFireability16153296004990058122.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.
[2023-03-15 09:31:31] [INFO ] Flatten gal took : 41 ms
[2023-03-15 09:31:31] [INFO ] Applying decomposition
[2023-03-15 09:31:31] [INFO ] Flatten gal took : 40 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/graph14510836772026343042.txt' '-o' '/tmp/graph14510836772026343042.bin' '-w' '/tmp/graph14510836772026343042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14510836772026343042.bin' '-l' '-1' '-v' '-w' '/tmp/graph14510836772026343042.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:31:31] [INFO ] Decomposing Gal with order
[2023-03-15 09:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:31:31] [INFO ] Removed a total of 1084 redundant transitions.
[2023-03-15 09:31:31] [INFO ] Flatten gal took : 145 ms
[2023-03-15 09:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 20 ms.
[2023-03-15 09:31:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16865001262516529254.gal : 9 ms
[2023-03-15 09:31:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7421497511816133660.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/ReachabilityFireability16865001262516529254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7421497511816133660.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/ReachabilityFireability7421497511816133660.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 128
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :128 after 2508
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2508 after 7991
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7991 after 1.56218e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.56218e+07 after 1.56218e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3132473888946088369
[2023-03-15 09:36:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3132473888946088369
Running compilation step : cd /tmp/ltsmin3132473888946088369;'/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 1971 ms.
Running link step : cd /tmp/ltsmin3132473888946088369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3132473888946088369;'/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.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.033: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.032: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.032: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.033: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.032: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.033: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.034: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.035: There are 1087 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.035: State length is 770, there are 1086 groups
pins2lts-mc-linux64( 0/ 8), 0.035: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.035: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.035: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.035: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 4.052: ~6 levels ~960 states ~3824 transitions
pins2lts-mc-linux64( 0/ 8), 4.086: ~6 levels ~1920 states ~4784 transitions
pins2lts-mc-linux64( 4/ 8), 5.010: ~3 levels ~3840 states ~98360 transitions
pins2lts-mc-linux64( 4/ 8), 5.189: ~3 levels ~7680 states ~109816 transitions
pins2lts-mc-linux64( 4/ 8), 5.591: ~3 levels ~15360 states ~132728 transitions
pins2lts-mc-linux64( 4/ 8), 6.318: ~3 levels ~30720 states ~178080 transitions
pins2lts-mc-linux64( 7/ 8), 9.013: ~3 levels ~61440 states ~267800 transitions
pins2lts-mc-linux64( 7/ 8), 12.960: ~4 levels ~122880 states ~448704 transitions
pins2lts-mc-linux64( 7/ 8), 20.577: ~5 levels ~245760 states ~688792 transitions
pins2lts-mc-linux64( 7/ 8), 30.583: ~8 levels ~491520 states ~959992 transitions
pins2lts-mc-linux64( 7/ 8), 44.247: ~11 levels ~983040 states ~2427280 transitions
pins2lts-mc-linux64( 7/ 8), 71.342: ~15 levels ~1966080 states ~4616272 transitions
pins2lts-mc-linux64( 7/ 8), 125.956: ~33 levels ~3932160 states ~8661712 transitions
pins2lts-mc-linux64( 5/ 8), 197.618: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 198.668:
pins2lts-mc-linux64( 0/ 8), 198.668: mean standard work distribution: 11.9% (states) 65.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 198.668:
pins2lts-mc-linux64( 0/ 8), 198.668: Explored 5557914 states 52023325 transitions, fanout: 9.360
pins2lts-mc-linux64( 0/ 8), 198.668: Total exploration time 198.620 sec (197.580 sec minimum, 197.917 sec on average)
pins2lts-mc-linux64( 0/ 8), 198.668: States per second: 27983, Transitions per second: 261924
pins2lts-mc-linux64( 0/ 8), 198.668:
pins2lts-mc-linux64( 0/ 8), 198.668: Queue width: 8B, total height: 14568268, memory: 111.15MB
pins2lts-mc-linux64( 0/ 8), 198.668: Tree memory: 409.3MB, 21.4 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 198.668: Tree fill ratio (roots/leafs): 14.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 198.668: Stored 1126 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 198.668: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 198.668: Est. total memory use: 520.4MB (~1135.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3132473888946088369;'/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/ltsmin3132473888946088369;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 09:39:52] [INFO ] Flatten gal took : 45 ms
[2023-03-15 09:39:52] [INFO ] Flatten gal took : 40 ms
[2023-03-15 09:39:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18145639312259729756.gal : 5 ms
[2023-03-15 09:39:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3005806927499633921.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/ReachabilityFireability18145639312259729756.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3005806927499633921.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/ReachabilityFireability3005806927499633921.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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PolyORBNT-COL-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 r320-tall-167873970600412"
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 ;