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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 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 1678871798545

Running Version 202205111006
[2023-03-15 09:16:39] [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:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:16:39] [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:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:16:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2023-03-15 09:16:40] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 27 ms.
[2023-03-15 09:16:40] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 61 ms.
[2023-03-15 09:16:40] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:16:40] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 09:16:40] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 09:16:40] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 652 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 09:16:41] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 09:16:41] [INFO ] Computed 182 place invariants in 123 ms
[2023-03-15 09:16:42] [INFO ] [Real]Absence check using 175 positive place invariants in 65 ms returned sat
[2023-03-15 09:16:42] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 09:16:42] [INFO ] After 1200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:16:43] [INFO ] [Nat]Absence check using 175 positive place invariants in 57 ms returned sat
[2023-03-15 09:16:43] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:16:46] [INFO ] After 3750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:16:48] [INFO ] After 2046ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:16:49] [INFO ] After 2195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-15 09:16:49] [INFO ] After 6284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 471 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2023-03-15 09:16:49] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2023-03-15 09:16:49] [INFO ] Computed 177 place invariants in 84 ms
[2023-03-15 09:16:50] [INFO ] Dead Transitions using invariants and state equation in 1251 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 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 63 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1189 places, 1426/1695 transitions.
Incomplete random walk after 1000000 steps, including 52119 resets, run finished after 6756 ms. (steps per millisecond=148 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2726 resets, run finished after 1593 ms. (steps per millisecond=627 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2152940 steps, run timeout after 24001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 2152940 steps, saw 671117 distinct states, run finished after 24004 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:17:23] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:17:23] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 09:17:23] [INFO ] [Real]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-15 09:17:23] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:17:24] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:17:24] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-15 09:17:24] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:17:24] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:17:25] [INFO ] After 193ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 326 places in 381 ms of which 1 ms to minimize.
[2023-03-15 09:17:25] [INFO ] Deduced a trap composed of 330 places in 379 ms of which 1 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 309 places in 365 ms of which 5 ms to minimize.
[2023-03-15 09:17:26] [INFO ] Deduced a trap composed of 335 places in 362 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 318 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:17:27] [INFO ] Deduced a trap composed of 338 places in 353 ms of which 1 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 338 places in 327 ms of which 2 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 315 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:17:28] [INFO ] Deduced a trap composed of 333 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:17:29] [INFO ] Deduced a trap composed of 329 places in 369 ms of which 1 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 312 places in 364 ms of which 1 ms to minimize.
[2023-03-15 09:17:30] [INFO ] Deduced a trap composed of 311 places in 355 ms of which 1 ms to minimize.
[2023-03-15 09:17:31] [INFO ] Deduced a trap composed of 335 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:17:32] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:17:32] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 314 places in 310 ms of which 0 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 320 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:17:33] [INFO ] Deduced a trap composed of 314 places in 310 ms of which 2 ms to minimize.
[2023-03-15 09:17:34] [INFO ] Deduced a trap composed of 335 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 278 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 305 places in 363 ms of which 1 ms to minimize.
[2023-03-15 09:17:35] [INFO ] Deduced a trap composed of 314 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 317 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:17:36] [INFO ] Deduced a trap composed of 344 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:17:37] [INFO ] Deduced a trap composed of 329 places in 330 ms of which 2 ms to minimize.
[2023-03-15 09:17:37] [INFO ] Deduced a trap composed of 320 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:17:37] [INFO ] Deduced a trap composed of 323 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:17:38] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 314 places in 330 ms of which 0 ms to minimize.
[2023-03-15 09:17:39] [INFO ] Deduced a trap composed of 323 places in 357 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 317 places in 358 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 329 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:17:40] [INFO ] Deduced a trap composed of 299 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:17:41] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:17:41] [INFO ] Deduced a trap composed of 311 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:17:42] [INFO ] Deduced a trap composed of 332 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:17:43] [INFO ] Deduced a trap composed of 335 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:17:45] [INFO ] Deduced a trap composed of 323 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 320 places in 345 ms of which 2 ms to minimize.
[2023-03-15 09:17:46] [INFO ] Deduced a trap composed of 332 places in 336 ms of which 1 ms to minimize.
[2023-03-15 09:17:47] [INFO ] Deduced a trap composed of 326 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:17:48] [INFO ] Deduced a trap composed of 341 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:17:50] [INFO ] Deduced a trap composed of 329 places in 325 ms of which 0 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:17:51] [INFO ] Deduced a trap composed of 335 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 1 ms to minimize.
[2023-03-15 09:17:52] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:17:53] [INFO ] Deduced a trap composed of 326 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:17:54] [INFO ] Deduced a trap composed of 305 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:17:55] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:17:56] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:17:58] [INFO ] Deduced a trap composed of 320 places in 329 ms of which 4 ms to minimize.
[2023-03-15 09:17:58] [INFO ] Deduced a trap composed of 341 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:18:00] [INFO ] Deduced a trap composed of 332 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:18:02] [INFO ] Deduced a trap composed of 317 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:18:03] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:18:04] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:18:05] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:18:05] [INFO ] Deduced a trap composed of 338 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:18:06] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:18:07] [INFO ] Deduced a trap composed of 332 places in 329 ms of which 3 ms to minimize.
[2023-03-15 09:18:07] [INFO ] Deduced a trap composed of 317 places in 348 ms of which 3 ms to minimize.
[2023-03-15 09:18:08] [INFO ] Deduced a trap composed of 320 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:18:09] [INFO ] Deduced a trap composed of 347 places in 348 ms of which 2 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 320 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:18:10] [INFO ] Deduced a trap composed of 323 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:18:16] [INFO ] Deduced a trap composed of 329 places in 346 ms of which 1 ms to minimize.
[2023-03-15 09:18:18] [INFO ] Deduced a trap composed of 314 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:18:19] [INFO ] Deduced a trap composed of 332 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 314 places in 351 ms of which 1 ms to minimize.
[2023-03-15 09:18:21] [INFO ] Deduced a trap composed of 317 places in 316 ms of which 0 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:18:22] [INFO ] Deduced a trap composed of 314 places in 351 ms of which 0 ms to minimize.
[2023-03-15 09:18:23] [INFO ] Deduced a trap composed of 323 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:18:27] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 1 ms to minimize.
[2023-03-15 09:18:32] [INFO ] Deduced a trap composed of 320 places in 317 ms of which 1 ms to minimize.
[2023-03-15 09:18:33] [INFO ] Deduced a trap composed of 326 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:18:38] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:18:40] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:18:45] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 341 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:18:46] [INFO ] Deduced a trap composed of 311 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:18:55] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 90577 ms
[2023-03-15 09:18:55] [INFO ] After 90929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:18:55] [INFO ] After 91689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 41 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 39 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 09:18:55] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:18:55] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-15 09:18:57] [INFO ] Implicit Places using invariants in 1430 ms returned []
[2023-03-15 09:18:57] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:18:57] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 09:18:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:04] [INFO ] Implicit Places using invariants and state equation in 6886 ms returned []
Implicit Place search using SMT with State Equation took 8317 ms to find 0 implicit places.
[2023-03-15 09:19:04] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-15 09:19:04] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:19:04] [INFO ] Computed 177 place invariants in 26 ms
[2023-03-15 09:19:05] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5251 resets, run finished after 731 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:19:06] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:19:06] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 09:19:06] [INFO ] [Real]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-15 09:19:06] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:19:06] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:19:07] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 09:19:07] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:19:07] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:19:07] [INFO ] After 184ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 326 places in 361 ms of which 1 ms to minimize.
[2023-03-15 09:19:08] [INFO ] Deduced a trap composed of 330 places in 483 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 309 places in 353 ms of which 1 ms to minimize.
[2023-03-15 09:19:09] [INFO ] Deduced a trap composed of 335 places in 465 ms of which 1 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 318 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 338 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:19:10] [INFO ] Deduced a trap composed of 338 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 315 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:19:11] [INFO ] Deduced a trap composed of 333 places in 355 ms of which 1 ms to minimize.
[2023-03-15 09:19:12] [INFO ] Deduced a trap composed of 329 places in 362 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 312 places in 372 ms of which 1 ms to minimize.
[2023-03-15 09:19:13] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 1 ms to minimize.
[2023-03-15 09:19:14] [INFO ] Deduced a trap composed of 335 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 323 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:19:15] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:19:16] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:19:17] [INFO ] Deduced a trap composed of 335 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 278 places in 321 ms of which 0 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 305 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:19:18] [INFO ] Deduced a trap composed of 314 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 317 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:19:19] [INFO ] Deduced a trap composed of 344 places in 354 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 329 places in 351 ms of which 0 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 320 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:19:20] [INFO ] Deduced a trap composed of 323 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:19:21] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 0 ms to minimize.
[2023-03-15 09:19:22] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:19:22] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 0 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 317 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 329 places in 357 ms of which 1 ms to minimize.
[2023-03-15 09:19:23] [INFO ] Deduced a trap composed of 299 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-15 09:19:24] [INFO ] Deduced a trap composed of 311 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:19:25] [INFO ] Deduced a trap composed of 332 places in 350 ms of which 1 ms to minimize.
[2023-03-15 09:19:26] [INFO ] Deduced a trap composed of 335 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:19:28] [INFO ] Deduced a trap composed of 323 places in 360 ms of which 1 ms to minimize.
[2023-03-15 09:19:29] [INFO ] Deduced a trap composed of 323 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:19:29] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:19:30] [INFO ] Deduced a trap composed of 326 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:19:31] [INFO ] Deduced a trap composed of 341 places in 301 ms of which 1 ms to minimize.
[2023-03-15 09:19:33] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 329 places in 311 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:19:34] [INFO ] Deduced a trap composed of 335 places in 298 ms of which 1 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 2 ms to minimize.
[2023-03-15 09:19:35] [INFO ] Deduced a trap composed of 326 places in 353 ms of which 0 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 317 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:19:36] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:19:37] [INFO ] Deduced a trap composed of 305 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:19:38] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:19:39] [INFO ] Deduced a trap composed of 317 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:19:41] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2023-03-15 09:19:44] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:19:45] [INFO ] Deduced a trap composed of 317 places in 376 ms of which 1 ms to minimize.
[2023-03-15 09:19:46] [INFO ] Deduced a trap composed of 326 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:19:47] [INFO ] Deduced a trap composed of 314 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:19:48] [INFO ] Deduced a trap composed of 308 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:19:48] [INFO ] Deduced a trap composed of 338 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:19:49] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:19:50] [INFO ] Deduced a trap composed of 332 places in 342 ms of which 0 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 317 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:19:51] [INFO ] Deduced a trap composed of 320 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:19:52] [INFO ] Deduced a trap composed of 347 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:19:53] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:19:54] [INFO ] Deduced a trap composed of 323 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:20:00] [INFO ] Deduced a trap composed of 329 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:20:01] [INFO ] Deduced a trap composed of 314 places in 343 ms of which 0 ms to minimize.
[2023-03-15 09:20:03] [INFO ] Deduced a trap composed of 332 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:20:04] [INFO ] Deduced a trap composed of 314 places in 352 ms of which 1 ms to minimize.
[2023-03-15 09:20:05] [INFO ] Deduced a trap composed of 317 places in 310 ms of which 0 ms to minimize.
[2023-03-15 09:20:05] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:20:06] [INFO ] Deduced a trap composed of 314 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:20:06] [INFO ] Deduced a trap composed of 323 places in 340 ms of which 0 ms to minimize.
[2023-03-15 09:20:11] [INFO ] Deduced a trap composed of 332 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:20:15] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:20:17] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:20:21] [INFO ] Deduced a trap composed of 311 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:20:24] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:20:29] [INFO ] Deduced a trap composed of 329 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:20:29] [INFO ] Deduced a trap composed of 341 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:20:30] [INFO ] Deduced a trap composed of 311 places in 348 ms of which 0 ms to minimize.
[2023-03-15 09:20:39] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 91351 ms
[2023-03-15 09:20:39] [INFO ] After 91839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:20:39] [INFO ] After 92553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52124 resets, run finished after 6475 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2676 resets, run finished after 1568 ms. (steps per millisecond=637 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2094559 steps, run timeout after 24001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 2094559 steps, saw 652382 distinct states, run finished after 24001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:21:11] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:21:11] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 09:21:11] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 09:21:11] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:21:12] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:21:12] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-15 09:21:12] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:21:13] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:21:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:21:13] [INFO ] After 188ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:21:13] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 2 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 330 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 309 places in 340 ms of which 0 ms to minimize.
[2023-03-15 09:21:14] [INFO ] Deduced a trap composed of 335 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 318 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:21:15] [INFO ] Deduced a trap composed of 338 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 338 places in 366 ms of which 1 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 315 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:21:16] [INFO ] Deduced a trap composed of 333 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:21:17] [INFO ] Deduced a trap composed of 329 places in 364 ms of which 1 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 312 places in 365 ms of which 0 ms to minimize.
[2023-03-15 09:21:18] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2023-03-15 09:21:19] [INFO ] Deduced a trap composed of 335 places in 352 ms of which 1 ms to minimize.
[2023-03-15 09:21:20] [INFO ] Deduced a trap composed of 326 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:21:20] [INFO ] Deduced a trap composed of 323 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 314 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 320 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:21:21] [INFO ] Deduced a trap composed of 314 places in 336 ms of which 1 ms to minimize.
[2023-03-15 09:21:22] [INFO ] Deduced a trap composed of 335 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 278 places in 352 ms of which 0 ms to minimize.
[2023-03-15 09:21:23] [INFO ] Deduced a trap composed of 305 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:21:24] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:21:24] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:21:24] [INFO ] Deduced a trap composed of 344 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:21:25] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 1 ms to minimize.
[2023-03-15 09:21:26] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 1 ms to minimize.
[2023-03-15 09:21:26] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:21:27] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 0 ms to minimize.
[2023-03-15 09:21:27] [INFO ] Deduced a trap composed of 323 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:21:28] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 0 ms to minimize.
[2023-03-15 09:21:28] [INFO ] Deduced a trap composed of 329 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:21:29] [INFO ] Deduced a trap composed of 299 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:21:29] [INFO ] Deduced a trap composed of 302 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:21:29] [INFO ] Deduced a trap composed of 311 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:21:30] [INFO ] Deduced a trap composed of 332 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:21:31] [INFO ] Deduced a trap composed of 335 places in 305 ms of which 1 ms to minimize.
[2023-03-15 09:21:33] [INFO ] Deduced a trap composed of 323 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 0 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 320 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:21:34] [INFO ] Deduced a trap composed of 332 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:21:35] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2023-03-15 09:21:36] [INFO ] Deduced a trap composed of 341 places in 311 ms of which 1 ms to minimize.
[2023-03-15 09:21:38] [INFO ] Deduced a trap composed of 329 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 1 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 1 ms to minimize.
[2023-03-15 09:21:39] [INFO ] Deduced a trap composed of 335 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:21:40] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 1 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 1 ms to minimize.
[2023-03-15 09:21:41] [INFO ] Deduced a trap composed of 326 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:21:42] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:21:43] [INFO ] Deduced a trap composed of 305 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 332 places in 338 ms of which 0 ms to minimize.
[2023-03-15 09:21:44] [INFO ] Deduced a trap composed of 317 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:21:46] [INFO ] Deduced a trap composed of 341 places in 343 ms of which 0 ms to minimize.
[2023-03-15 09:21:49] [INFO ] Deduced a trap composed of 332 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:21:51] [INFO ] Deduced a trap composed of 317 places in 350 ms of which 2 ms to minimize.
[2023-03-15 09:21:52] [INFO ] Deduced a trap composed of 326 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 314 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:21:53] [INFO ] Deduced a trap composed of 308 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 338 places in 299 ms of which 1 ms to minimize.
[2023-03-15 09:21:54] [INFO ] Deduced a trap composed of 302 places in 336 ms of which 0 ms to minimize.
[2023-03-15 09:21:55] [INFO ] Deduced a trap composed of 332 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 317 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:21:56] [INFO ] Deduced a trap composed of 320 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:21:57] [INFO ] Deduced a trap composed of 347 places in 342 ms of which 1 ms to minimize.
[2023-03-15 09:21:58] [INFO ] Deduced a trap composed of 320 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:21:59] [INFO ] Deduced a trap composed of 323 places in 343 ms of which 0 ms to minimize.
[2023-03-15 09:22:05] [INFO ] Deduced a trap composed of 329 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:22:07] [INFO ] Deduced a trap composed of 314 places in 352 ms of which 1 ms to minimize.
[2023-03-15 09:22:08] [INFO ] Deduced a trap composed of 332 places in 350 ms of which 1 ms to minimize.
[2023-03-15 09:22:09] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:22:10] [INFO ] Deduced a trap composed of 317 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:22:10] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:22:11] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:22:12] [INFO ] Deduced a trap composed of 323 places in 304 ms of which 1 ms to minimize.
[2023-03-15 09:22:16] [INFO ] Deduced a trap composed of 332 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:22:20] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:22:22] [INFO ] Deduced a trap composed of 326 places in 311 ms of which 1 ms to minimize.
[2023-03-15 09:22:26] [INFO ] Deduced a trap composed of 311 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:22:29] [INFO ] Deduced a trap composed of 332 places in 331 ms of which 3 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 329 places in 338 ms of which 8 ms to minimize.
[2023-03-15 09:22:34] [INFO ] Deduced a trap composed of 341 places in 317 ms of which 1 ms to minimize.
[2023-03-15 09:22:35] [INFO ] Deduced a trap composed of 311 places in 342 ms of which 1 ms to minimize.
[2023-03-15 09:22:44] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 91047 ms
[2023-03-15 09:22:44] [INFO ] After 91395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:22:44] [INFO ] After 92178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 39 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 37 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 09:22:44] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:22:44] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 09:22:46] [INFO ] Implicit Places using invariants in 1448 ms returned []
[2023-03-15 09:22:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:22:46] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-15 09:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:22:52] [INFO ] Implicit Places using invariants and state equation in 6972 ms returned []
Implicit Place search using SMT with State Equation took 8429 ms to find 0 implicit places.
[2023-03-15 09:22:53] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 09:22:53] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:22:53] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-15 09:22:54] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5148 resets, run finished after 628 ms. (steps per millisecond=159 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:22:54] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:22:54] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 09:22:54] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 09:22:54] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:22:55] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:22:55] [INFO ] [Nat]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 09:22:55] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:22:56] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:22:56] [INFO ] After 184ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:22:56] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 0 ms to minimize.
[2023-03-15 09:22:57] [INFO ] Deduced a trap composed of 330 places in 355 ms of which 1 ms to minimize.
[2023-03-15 09:22:57] [INFO ] Deduced a trap composed of 309 places in 360 ms of which 0 ms to minimize.
[2023-03-15 09:22:58] [INFO ] Deduced a trap composed of 335 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:22:58] [INFO ] Deduced a trap composed of 318 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:22:58] [INFO ] Deduced a trap composed of 338 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:22:59] [INFO ] Deduced a trap composed of 338 places in 356 ms of which 1 ms to minimize.
[2023-03-15 09:22:59] [INFO ] Deduced a trap composed of 315 places in 353 ms of which 0 ms to minimize.
[2023-03-15 09:23:00] [INFO ] Deduced a trap composed of 333 places in 356 ms of which 1 ms to minimize.
[2023-03-15 09:23:00] [INFO ] Deduced a trap composed of 329 places in 365 ms of which 1 ms to minimize.
[2023-03-15 09:23:01] [INFO ] Deduced a trap composed of 312 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:23:01] [INFO ] Deduced a trap composed of 311 places in 331 ms of which 0 ms to minimize.
[2023-03-15 09:23:02] [INFO ] Deduced a trap composed of 335 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:23:03] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:23:03] [INFO ] Deduced a trap composed of 323 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:23:04] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 0 ms to minimize.
[2023-03-15 09:23:04] [INFO ] Deduced a trap composed of 320 places in 360 ms of which 1 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 314 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:23:05] [INFO ] Deduced a trap composed of 335 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:23:06] [INFO ] Deduced a trap composed of 278 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:23:06] [INFO ] Deduced a trap composed of 305 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 314 places in 346 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 317 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:23:07] [INFO ] Deduced a trap composed of 344 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:23:08] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:23:08] [INFO ] Deduced a trap composed of 320 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:23:09] [INFO ] Deduced a trap composed of 323 places in 319 ms of which 0 ms to minimize.
[2023-03-15 09:23:09] [INFO ] Deduced a trap composed of 323 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:23:10] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:23:10] [INFO ] Deduced a trap composed of 323 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 317 places in 321 ms of which 0 ms to minimize.
[2023-03-15 09:23:11] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 299 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:23:12] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 0 ms to minimize.
[2023-03-15 09:23:13] [INFO ] Deduced a trap composed of 311 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:23:13] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:23:14] [INFO ] Deduced a trap composed of 335 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:23:16] [INFO ] Deduced a trap composed of 323 places in 349 ms of which 1 ms to minimize.
[2023-03-15 09:23:17] [INFO ] Deduced a trap composed of 323 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:23:17] [INFO ] Deduced a trap composed of 320 places in 342 ms of which 0 ms to minimize.
[2023-03-15 09:23:18] [INFO ] Deduced a trap composed of 332 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:23:18] [INFO ] Deduced a trap composed of 326 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:23:19] [INFO ] Deduced a trap composed of 341 places in 335 ms of which 1 ms to minimize.
[2023-03-15 09:23:21] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:23:22] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:23:22] [INFO ] Deduced a trap composed of 314 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:23:22] [INFO ] Deduced a trap composed of 335 places in 325 ms of which 0 ms to minimize.
[2023-03-15 09:23:23] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:23:23] [INFO ] Deduced a trap composed of 326 places in 335 ms of which 1 ms to minimize.
[2023-03-15 09:23:24] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:23:24] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:23:25] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 2 ms to minimize.
[2023-03-15 09:23:25] [INFO ] Deduced a trap composed of 305 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 332 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:23:27] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 320 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:23:29] [INFO ] Deduced a trap composed of 341 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:23:32] [INFO ] Deduced a trap composed of 332 places in 352 ms of which 0 ms to minimize.
[2023-03-15 09:23:34] [INFO ] Deduced a trap composed of 317 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:23:34] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 1 ms to minimize.
[2023-03-15 09:23:36] [INFO ] Deduced a trap composed of 314 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:23:36] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 1 ms to minimize.
[2023-03-15 09:23:37] [INFO ] Deduced a trap composed of 338 places in 343 ms of which 1 ms to minimize.
[2023-03-15 09:23:37] [INFO ] Deduced a trap composed of 302 places in 348 ms of which 0 ms to minimize.
[2023-03-15 09:23:38] [INFO ] Deduced a trap composed of 332 places in 311 ms of which 1 ms to minimize.
[2023-03-15 09:23:39] [INFO ] Deduced a trap composed of 317 places in 308 ms of which 1 ms to minimize.
[2023-03-15 09:23:39] [INFO ] Deduced a trap composed of 320 places in 342 ms of which 0 ms to minimize.
[2023-03-15 09:23:40] [INFO ] Deduced a trap composed of 347 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:23:41] [INFO ] Deduced a trap composed of 320 places in 303 ms of which 0 ms to minimize.
[2023-03-15 09:23:42] [INFO ] Deduced a trap composed of 323 places in 302 ms of which 1 ms to minimize.
[2023-03-15 09:23:48] [INFO ] Deduced a trap composed of 329 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:23:49] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:23:51] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:23:52] [INFO ] Deduced a trap composed of 314 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 317 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:23:53] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-15 09:23:54] [INFO ] Deduced a trap composed of 314 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:23:55] [INFO ] Deduced a trap composed of 323 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:23:59] [INFO ] Deduced a trap composed of 332 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:24:03] [INFO ] Deduced a trap composed of 320 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:24:05] [INFO ] Deduced a trap composed of 326 places in 382 ms of which 0 ms to minimize.
[2023-03-15 09:24:09] [INFO ] Deduced a trap composed of 311 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:24:12] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:24:16] [INFO ] Deduced a trap composed of 329 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:24:17] [INFO ] Deduced a trap composed of 341 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:24:18] [INFO ] Deduced a trap composed of 311 places in 354 ms of which 2 ms to minimize.
[2023-03-15 09:24:27] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 90695 ms
[2023-03-15 09:24:27] [INFO ] After 91135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:24:27] [INFO ] After 91879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 521 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 36 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264339 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264339 steps, saw 79567 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:24:30] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:24:30] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 09:24:30] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 09:24:30] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:24:31] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:24:31] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 09:24:31] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 09:24:32] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:24:32] [INFO ] After 595ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:24:33] [INFO ] Deduced a trap composed of 315 places in 365 ms of which 0 ms to minimize.
[2023-03-15 09:24:33] [INFO ] Deduced a trap composed of 326 places in 378 ms of which 1 ms to minimize.
[2023-03-15 09:24:34] [INFO ] Deduced a trap composed of 323 places in 367 ms of which 0 ms to minimize.
[2023-03-15 09:24:34] [INFO ] Deduced a trap composed of 308 places in 365 ms of which 1 ms to minimize.
[2023-03-15 09:24:35] [INFO ] Deduced a trap composed of 338 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:24:35] [INFO ] Deduced a trap composed of 318 places in 360 ms of which 1 ms to minimize.
[2023-03-15 09:24:35] [INFO ] Deduced a trap composed of 317 places in 359 ms of which 1 ms to minimize.
[2023-03-15 09:24:36] [INFO ] Deduced a trap composed of 305 places in 373 ms of which 1 ms to minimize.
[2023-03-15 09:24:37] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 1 ms to minimize.
[2023-03-15 09:24:37] [INFO ] Deduced a trap composed of 306 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 341 places in 326 ms of which 0 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:24:38] [INFO ] Deduced a trap composed of 344 places in 308 ms of which 1 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 326 places in 310 ms of which 1 ms to minimize.
[2023-03-15 09:24:39] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 323 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 311 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:24:40] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2023-03-15 09:24:41] [INFO ] Deduced a trap composed of 314 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:24:41] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:24:42] [INFO ] Deduced a trap composed of 347 places in 346 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 335 places in 354 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 1 ms to minimize.
[2023-03-15 09:24:43] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 320 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:24:44] [INFO ] Deduced a trap composed of 333 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:24:45] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:24:46] [INFO ] Deduced a trap composed of 305 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:24:46] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 0 ms to minimize.
[2023-03-15 09:24:47] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:24:48] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 1 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 350 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 314 places in 333 ms of which 0 ms to minimize.
[2023-03-15 09:24:49] [INFO ] Deduced a trap composed of 323 places in 360 ms of which 1 ms to minimize.
[2023-03-15 09:24:50] [INFO ] Deduced a trap composed of 314 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 326 places in 351 ms of which 1 ms to minimize.
[2023-03-15 09:24:51] [INFO ] Deduced a trap composed of 338 places in 345 ms of which 0 ms to minimize.
[2023-03-15 09:24:52] [INFO ] Deduced a trap composed of 296 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:24:53] [INFO ] Deduced a trap composed of 335 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:24:53] [INFO ] Deduced a trap composed of 335 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:24:54] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:24:55] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 1 ms to minimize.
[2023-03-15 09:24:56] [INFO ] Deduced a trap composed of 329 places in 325 ms of which 0 ms to minimize.
[2023-03-15 09:24:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:24:56] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 46 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 09:24:56] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:24:56] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 09:24:57] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 514 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266020 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266020 steps, saw 80085 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:25:00] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:25:00] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 09:25:00] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-15 09:25:00] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:25:01] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:25:01] [INFO ] [Nat]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-15 09:25:01] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:25:02] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:25:02] [INFO ] After 616ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:03] [INFO ] Deduced a trap composed of 315 places in 352 ms of which 1 ms to minimize.
[2023-03-15 09:25:03] [INFO ] Deduced a trap composed of 326 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:25:04] [INFO ] Deduced a trap composed of 323 places in 346 ms of which 1 ms to minimize.
[2023-03-15 09:25:04] [INFO ] Deduced a trap composed of 308 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:25:04] [INFO ] Deduced a trap composed of 338 places in 356 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 318 places in 368 ms of which 0 ms to minimize.
[2023-03-15 09:25:05] [INFO ] Deduced a trap composed of 317 places in 367 ms of which 1 ms to minimize.
[2023-03-15 09:25:06] [INFO ] Deduced a trap composed of 305 places in 347 ms of which 1 ms to minimize.
[2023-03-15 09:25:07] [INFO ] Deduced a trap composed of 330 places in 359 ms of which 0 ms to minimize.
[2023-03-15 09:25:07] [INFO ] Deduced a trap composed of 306 places in 372 ms of which 1 ms to minimize.
[2023-03-15 09:25:08] [INFO ] Deduced a trap composed of 341 places in 350 ms of which 1 ms to minimize.
[2023-03-15 09:25:08] [INFO ] Deduced a trap composed of 314 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:25:08] [INFO ] Deduced a trap composed of 344 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:25:09] [INFO ] Deduced a trap composed of 326 places in 349 ms of which 0 ms to minimize.
[2023-03-15 09:25:09] [INFO ] Deduced a trap composed of 326 places in 355 ms of which 1 ms to minimize.
[2023-03-15 09:25:10] [INFO ] Deduced a trap composed of 323 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:25:10] [INFO ] Deduced a trap composed of 311 places in 332 ms of which 0 ms to minimize.
[2023-03-15 09:25:10] [INFO ] Deduced a trap composed of 326 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:25:11] [INFO ] Deduced a trap composed of 314 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:25:12] [INFO ] Deduced a trap composed of 314 places in 327 ms of which 0 ms to minimize.
[2023-03-15 09:25:12] [INFO ] Deduced a trap composed of 347 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:25:13] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:25:13] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:25:13] [INFO ] Deduced a trap composed of 329 places in 362 ms of which 1 ms to minimize.
[2023-03-15 09:25:14] [INFO ] Deduced a trap composed of 320 places in 345 ms of which 0 ms to minimize.
[2023-03-15 09:25:14] [INFO ] Deduced a trap composed of 333 places in 359 ms of which 1 ms to minimize.
[2023-03-15 09:25:15] [INFO ] Deduced a trap composed of 314 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:25:16] [INFO ] Deduced a trap composed of 305 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:25:16] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:25:17] [INFO ] Deduced a trap composed of 317 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:25:18] [INFO ] Deduced a trap composed of 317 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:25:18] [INFO ] Deduced a trap composed of 350 places in 326 ms of which 0 ms to minimize.
[2023-03-15 09:25:19] [INFO ] Deduced a trap composed of 314 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:25:19] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:25:20] [INFO ] Deduced a trap composed of 314 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:25:21] [INFO ] Deduced a trap composed of 326 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:25:21] [INFO ] Deduced a trap composed of 338 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:25:22] [INFO ] Deduced a trap composed of 296 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:25:23] [INFO ] Deduced a trap composed of 335 places in 372 ms of which 3 ms to minimize.
[2023-03-15 09:25:23] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:25:24] [INFO ] Deduced a trap composed of 302 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-15 09:25:25] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:25:26] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23645 ms
[2023-03-15 09:25:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:25:26] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 38 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 33 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 09:25:26] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:25:26] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-15 09:25:28] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-15 09:25:28] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:25:28] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 09:25:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:25:36] [INFO ] Implicit Places using invariants and state equation in 8690 ms returned []
Implicit Place search using SMT with State Equation took 10125 ms to find 0 implicit places.
[2023-03-15 09:25:36] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 09:25:36] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 09:25:36] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-15 09:25:37] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1010/1010 places, 1426/1426 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 1010 transition count 1422
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 1010 transition count 1421
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 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 187 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2023-03-15 09:25:37] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-15 09:25:38] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 09:25:38] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 09:25:38] [INFO ] After 438ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:25:39] [INFO ] Deduced a trap composed of 327 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-15 09:25:39] [INFO ] After 914ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:25:39] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:25:39] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 09:25:39] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:25:39] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 327 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 312 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:25:40] [INFO ] Deduced a trap composed of 330 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:25:41] [INFO ] Deduced a trap composed of 327 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 309 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 300 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:25:42] [INFO ] Deduced a trap composed of 330 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 312 places in 301 ms of which 1 ms to minimize.
[2023-03-15 09:25:43] [INFO ] Deduced a trap composed of 333 places in 322 ms of which 0 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 330 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:25:44] [INFO ] Deduced a trap composed of 324 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:25:45] [INFO ] Deduced a trap composed of 321 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:25:45] [INFO ] Deduced a trap composed of 312 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 327 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 324 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:25:46] [INFO ] Deduced a trap composed of 324 places in 302 ms of which 0 ms to minimize.
[2023-03-15 09:25:47] [INFO ] Deduced a trap composed of 324 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:25:47] [INFO ] Deduced a trap composed of 321 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:25:48] [INFO ] Deduced a trap composed of 318 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:25:48] [INFO ] Deduced a trap composed of 312 places in 310 ms of which 1 ms to minimize.
[2023-03-15 09:25:48] [INFO ] Deduced a trap composed of 330 places in 315 ms of which 0 ms to minimize.
[2023-03-15 09:25:49] [INFO ] Deduced a trap composed of 321 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:25:49] [INFO ] Deduced a trap composed of 309 places in 301 ms of which 0 ms to minimize.
[2023-03-15 09:25:50] [INFO ] Deduced a trap composed of 342 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:25:50] [INFO ] Deduced a trap composed of 330 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:25:50] [INFO ] Deduced a trap composed of 321 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:25:51] [INFO ] Deduced a trap composed of 336 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:25:51] [INFO ] Deduced a trap composed of 306 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:25:51] [INFO ] Deduced a trap composed of 327 places in 305 ms of which 1 ms to minimize.
[2023-03-15 09:25:52] [INFO ] Deduced a trap composed of 324 places in 300 ms of which 0 ms to minimize.
[2023-03-15 09:25:52] [INFO ] Deduced a trap composed of 330 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 333 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:25:53] [INFO ] Deduced a trap composed of 291 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 306 places in 305 ms of which 1 ms to minimize.
[2023-03-15 09:25:54] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 315 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:25:55] [INFO ] Deduced a trap composed of 330 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 321 places in 348 ms of which 1 ms to minimize.
[2023-03-15 09:25:56] [INFO ] Deduced a trap composed of 327 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 339 places in 359 ms of which 1 ms to minimize.
[2023-03-15 09:25:57] [INFO ] Deduced a trap composed of 315 places in 329 ms of which 0 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 333 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:25:58] [INFO ] Deduced a trap composed of 339 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:25:59] [INFO ] Deduced a trap composed of 324 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:25:59] [INFO ] Deduced a trap composed of 330 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:26:00] [INFO ] Deduced a trap composed of 336 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:26:00] [INFO ] Deduced a trap composed of 312 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:26:01] [INFO ] Deduced a trap composed of 333 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:26:01] [INFO ] Deduced a trap composed of 327 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 315 places in 331 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 300 places in 335 ms of which 1 ms to minimize.
[2023-03-15 09:26:02] [INFO ] Deduced a trap composed of 306 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 336 places in 336 ms of which 1 ms to minimize.
[2023-03-15 09:26:03] [INFO ] Deduced a trap composed of 330 places in 346 ms of which 1 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 318 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:26:04] [INFO ] Deduced a trap composed of 321 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:26:05] [INFO ] Deduced a trap composed of 312 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:26:06] [INFO ] Deduced a trap composed of 327 places in 320 ms of which 0 ms to minimize.
[2023-03-15 09:26:06] [INFO ] Deduced a trap composed of 330 places in 322 ms of which 0 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:26:07] [INFO ] Deduced a trap composed of 318 places in 326 ms of which 1 ms to minimize.
[2023-03-15 09:26:08] [INFO ] Deduced a trap composed of 300 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:26:09] [INFO ] Deduced a trap composed of 312 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:26:10] [INFO ] Deduced a trap composed of 324 places in 333 ms of which 2 ms to minimize.
[2023-03-15 09:26:13] [INFO ] Deduced a trap composed of 321 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:26:17] [INFO ] Deduced a trap composed of 324 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:26:17] [INFO ] Deduced a trap composed of 333 places in 324 ms of which 0 ms to minimize.
[2023-03-15 09:26:18] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:26:20] [INFO ] Deduced a trap composed of 318 places in 358 ms of which 1 ms to minimize.
[2023-03-15 09:26:21] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:26:24] [INFO ] Deduced a trap composed of 303 places in 329 ms of which 0 ms to minimize.
[2023-03-15 09:26:33] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 53448 ms
[2023-03-15 09:26:33] [INFO ] After 53967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:26:33] [INFO ] After 54193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:26:33] [INFO ] Flatten gal took : 357 ms
[2023-03-15 09:26:34] [INFO ] Flatten gal took : 258 ms
[2023-03-15 09:26:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4021768290790221781.gal : 44 ms
[2023-03-15 09:26:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16420538590698752100.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13185611064244189533;'/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/ReachabilityCardinality4021768290790221781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16420538590698752100.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/ReachabilityCardinality16420538590698752100.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :38 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :55 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 94
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94 after 210
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210 after 5770
Detected timeout of ITS tools.
[2023-03-15 09:26:49] [INFO ] Flatten gal took : 142 ms
[2023-03-15 09:26:49] [INFO ] Applying decomposition
[2023-03-15 09:26:49] [INFO ] Flatten gal took : 83 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/graph11082438479967144376.txt' '-o' '/tmp/graph11082438479967144376.bin' '-w' '/tmp/graph11082438479967144376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11082438479967144376.bin' '-l' '-1' '-v' '-w' '/tmp/graph11082438479967144376.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:26:49] [INFO ] Decomposing Gal with order
[2023-03-15 09:26:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:26:50] [INFO ] Removed a total of 1526 redundant transitions.
[2023-03-15 09:26:50] [INFO ] Flatten gal took : 750 ms
[2023-03-15 09:26:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 791 labels/synchronizations in 95 ms.
[2023-03-15 09:26:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3316472060710884018.gal : 25 ms
[2023-03-15 09:26:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12815315141413344350.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13185611064244189533;'/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/ReachabilityCardinality3316472060710884018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12815315141413344350.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/ReachabilityCardinality12815315141413344350.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12045395763909946547
[2023-03-15 09:27:05] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12045395763909946547
Running compilation step : cd /tmp/ltsmin12045395763909946547;'/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 2995 ms.
Running link step : cd /tmp/ltsmin12045395763909946547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12045395763909946547;'/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 1010 transition count 1422
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 1010 transition count 1421
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 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 123 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2023-03-15 09:27:20] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 09:27:21] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 09:27:21] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:27:21] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:27:21] [INFO ] Deduced a trap composed of 327 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-15 09:27:22] [INFO ] After 904ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:27:22] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:27:22] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 09:27:22] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 09:27:22] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:27:23] [INFO ] Deduced a trap composed of 327 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:27:23] [INFO ] Deduced a trap composed of 312 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:27:23] [INFO ] Deduced a trap composed of 330 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:27:24] [INFO ] Deduced a trap composed of 327 places in 304 ms of which 1 ms to minimize.
[2023-03-15 09:27:25] [INFO ] Deduced a trap composed of 309 places in 326 ms of which 3 ms to minimize.
[2023-03-15 09:27:25] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 0 ms to minimize.
[2023-03-15 09:27:25] [INFO ] Deduced a trap composed of 330 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:27:26] [INFO ] Deduced a trap composed of 312 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:27:26] [INFO ] Deduced a trap composed of 333 places in 319 ms of which 1 ms to minimize.
[2023-03-15 09:27:27] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:27:27] [INFO ] Deduced a trap composed of 330 places in 328 ms of which 1 ms to minimize.
[2023-03-15 09:27:27] [INFO ] Deduced a trap composed of 324 places in 331 ms of which 2 ms to minimize.
[2023-03-15 09:27:28] [INFO ] Deduced a trap composed of 321 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:27:28] [INFO ] Deduced a trap composed of 312 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:27:29] [INFO ] Deduced a trap composed of 327 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:27:29] [INFO ] Deduced a trap composed of 324 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:27:29] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 0 ms to minimize.
[2023-03-15 09:27:30] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 1 ms to minimize.
[2023-03-15 09:27:30] [INFO ] Deduced a trap composed of 321 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:27:31] [INFO ] Deduced a trap composed of 318 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:31] [INFO ] Deduced a trap composed of 312 places in 325 ms of which 1 ms to minimize.
[2023-03-15 09:27:31] [INFO ] Deduced a trap composed of 330 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:27:32] [INFO ] Deduced a trap composed of 321 places in 318 ms of which 0 ms to minimize.
[2023-03-15 09:27:32] [INFO ] Deduced a trap composed of 309 places in 314 ms of which 1 ms to minimize.
[2023-03-15 09:27:33] [INFO ] Deduced a trap composed of 342 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:27:33] [INFO ] Deduced a trap composed of 330 places in 326 ms of which 0 ms to minimize.
[2023-03-15 09:27:33] [INFO ] Deduced a trap composed of 321 places in 327 ms of which 1 ms to minimize.
[2023-03-15 09:27:34] [INFO ] Deduced a trap composed of 336 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:34] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 1 ms to minimize.
[2023-03-15 09:27:35] [INFO ] Deduced a trap composed of 327 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:27:35] [INFO ] Deduced a trap composed of 324 places in 337 ms of which 1 ms to minimize.
[2023-03-15 09:27:36] [INFO ] Deduced a trap composed of 330 places in 340 ms of which 1 ms to minimize.
[2023-03-15 09:27:36] [INFO ] Deduced a trap composed of 333 places in 319 ms of which 0 ms to minimize.
[2023-03-15 09:27:37] [INFO ] Deduced a trap composed of 291 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:27:37] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 1 ms to minimize.
[2023-03-15 09:27:38] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 0 ms to minimize.
[2023-03-15 09:27:38] [INFO ] Deduced a trap composed of 315 places in 329 ms of which 1 ms to minimize.
[2023-03-15 09:27:39] [INFO ] Deduced a trap composed of 330 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:27:39] [INFO ] Deduced a trap composed of 321 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:27:39] [INFO ] Deduced a trap composed of 327 places in 319 ms of which 0 ms to minimize.
[2023-03-15 09:27:40] [INFO ] Deduced a trap composed of 339 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:40] [INFO ] Deduced a trap composed of 315 places in 333 ms of which 1 ms to minimize.
[2023-03-15 09:27:41] [INFO ] Deduced a trap composed of 333 places in 322 ms of which 0 ms to minimize.
[2023-03-15 09:27:42] [INFO ] Deduced a trap composed of 339 places in 322 ms of which 1 ms to minimize.
[2023-03-15 09:27:42] [INFO ] Deduced a trap composed of 324 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:27:42] [INFO ] Deduced a trap composed of 330 places in 341 ms of which 0 ms to minimize.
[2023-03-15 09:27:43] [INFO ] Deduced a trap composed of 336 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:27:43] [INFO ] Deduced a trap composed of 312 places in 338 ms of which 0 ms to minimize.
[2023-03-15 09:27:44] [INFO ] Deduced a trap composed of 333 places in 339 ms of which 1 ms to minimize.
[2023-03-15 09:27:44] [INFO ] Deduced a trap composed of 327 places in 324 ms of which 1 ms to minimize.
[2023-03-15 09:27:45] [INFO ] Deduced a trap composed of 315 places in 324 ms of which 0 ms to minimize.
[2023-03-15 09:27:45] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:46] [INFO ] Deduced a trap composed of 306 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:46] [INFO ] Deduced a trap composed of 336 places in 328 ms of which 0 ms to minimize.
[2023-03-15 09:27:47] [INFO ] Deduced a trap composed of 330 places in 317 ms of which 0 ms to minimize.
[2023-03-15 09:27:47] [INFO ] Deduced a trap composed of 318 places in 310 ms of which 1 ms to minimize.
[2023-03-15 09:27:47] [INFO ] Deduced a trap composed of 321 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:27:48] [INFO ] Deduced a trap composed of 312 places in 316 ms of which 1 ms to minimize.
[2023-03-15 09:27:49] [INFO ] Deduced a trap composed of 327 places in 340 ms of which 0 ms to minimize.
[2023-03-15 09:27:49] [INFO ] Deduced a trap composed of 330 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:27:50] [INFO ] Deduced a trap composed of 324 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:27:51] [INFO ] Deduced a trap composed of 318 places in 338 ms of which 1 ms to minimize.
[2023-03-15 09:27:51] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 1 ms to minimize.
[2023-03-15 09:27:52] [INFO ] Deduced a trap composed of 312 places in 318 ms of which 1 ms to minimize.
[2023-03-15 09:27:53] [INFO ] Deduced a trap composed of 324 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:27:57] [INFO ] Deduced a trap composed of 321 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:28:00] [INFO ] Deduced a trap composed of 324 places in 332 ms of which 1 ms to minimize.
[2023-03-15 09:28:01] [INFO ] Deduced a trap composed of 333 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:28:01] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 0 ms to minimize.
[2023-03-15 09:28:03] [INFO ] Deduced a trap composed of 318 places in 321 ms of which 1 ms to minimize.
[2023-03-15 09:28:05] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 0 ms to minimize.
[2023-03-15 09:28:07] [INFO ] Deduced a trap composed of 303 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:28:16] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 53646 ms
[2023-03-15 09:28:16] [INFO ] After 54251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:28:16] [INFO ] After 54434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:28:16] [INFO ] Flatten gal took : 123 ms
[2023-03-15 09:28:16] [INFO ] Flatten gal took : 73 ms
[2023-03-15 09:28:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16676476745764572291.gal : 11 ms
[2023-03-15 09:28:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6267273335721490240.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/ReachabilityCardinality16676476745764572291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6267273335721490240.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/ReachabilityCardinality6267273335721490240.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :38 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :55 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 94
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94 after 210
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210 after 5770
Detected timeout of ITS tools.
[2023-03-15 09:28:31] [INFO ] Flatten gal took : 70 ms
[2023-03-15 09:28:31] [INFO ] Applying decomposition
[2023-03-15 09:28:31] [INFO ] Flatten gal took : 78 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/graph2229027113137485286.txt' '-o' '/tmp/graph2229027113137485286.bin' '-w' '/tmp/graph2229027113137485286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2229027113137485286.bin' '-l' '-1' '-v' '-w' '/tmp/graph2229027113137485286.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:28:32] [INFO ] Decomposing Gal with order
[2023-03-15 09:28:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:28:32] [INFO ] Removed a total of 1544 redundant transitions.
[2023-03-15 09:28:32] [INFO ] Flatten gal took : 179 ms
[2023-03-15 09:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 525 labels/synchronizations in 34 ms.
[2023-03-15 09:28:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5415133878652126876.gal : 11 ms
[2023-03-15 09:28:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13428819572604620340.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/ReachabilityCardinality5415133878652126876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13428819572604620340.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/ReachabilityCardinality13428819572604620340.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.88098e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9322043131870200342
[2023-03-15 09:28:47] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9322043131870200342
Running compilation step : cd /tmp/ltsmin9322043131870200342;'/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 2830 ms.
Running link step : cd /tmp/ltsmin9322043131870200342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9322043131870200342;'/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:29:02] [INFO ] Flatten gal took : 64 ms
[2023-03-15 09:29:02] [INFO ] Flatten gal took : 62 ms
[2023-03-15 09:29:02] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8543753001804889090.gal : 8 ms
[2023-03-15 09:29:02] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5808757396121130961.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/ReachabilityFireability8543753001804889090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5808757396121130961.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/ReachabilityFireability5808757396121130961.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
Detected timeout of ITS tools.
[2023-03-15 09:29:05] [INFO ] Flatten gal took : 56 ms
[2023-03-15 09:29:05] [INFO ] Applying decomposition
[2023-03-15 09:29:05] [INFO ] Flatten gal took : 56 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/graph6384068239395870086.txt' '-o' '/tmp/graph6384068239395870086.bin' '-w' '/tmp/graph6384068239395870086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6384068239395870086.bin' '-l' '-1' '-v' '-w' '/tmp/graph6384068239395870086.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:29:06] [INFO ] Decomposing Gal with order
[2023-03-15 09:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:29:06] [INFO ] Removed a total of 1684 redundant transitions.
[2023-03-15 09:29:06] [INFO ] Flatten gal took : 177 ms
[2023-03-15 09:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 35 ms.
[2023-03-15 09:29:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17924504771359924894.gal : 13 ms
[2023-03-15 09:29:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5892106846277333518.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/ReachabilityFireability17924504771359924894.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5892106846277333518.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/ReachabilityFireability5892106846277333518.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 4284
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4284 after 4358
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4358 after 4432
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4432 after 4506
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4506 after 4654
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4654 after 4802
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4802 after 5024
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5024 after 5394
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5394 after 6356
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10528425538842346884
[2023-03-15 09:29:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10528425538842346884
Running compilation step : cd /tmp/ltsmin10528425538842346884;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10528425538842346884;'/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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10528425538842346884;'/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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2023-03-15 09:29:11] [INFO ] Flatten gal took : 57 ms
[2023-03-15 09:29:11] [INFO ] Flatten gal took : 57 ms
[2023-03-15 09:29:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9907667628092395103.gal : 8 ms
[2023-03-15 09:29:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14933623769495474549.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/ReachabilityFireability9907667628092395103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14933623769495474549.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/ReachabilityFireability14933623769495474549.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
Detected timeout of ITS tools.
[2023-03-15 09:29:41] [INFO ] Flatten gal took : 54 ms
[2023-03-15 09:29:41] [INFO ] Applying decomposition
[2023-03-15 09:29:41] [INFO ] Flatten gal took : 54 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/graph8962030090024184625.txt' '-o' '/tmp/graph8962030090024184625.bin' '-w' '/tmp/graph8962030090024184625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8962030090024184625.bin' '-l' '-1' '-v' '-w' '/tmp/graph8962030090024184625.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:29:41] [INFO ] Decomposing Gal with order
[2023-03-15 09:29:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:29:42] [INFO ] Removed a total of 1837 redundant transitions.
[2023-03-15 09:29:42] [INFO ] Flatten gal took : 145 ms
[2023-03-15 09:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 16 ms.
[2023-03-15 09:29:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16966231441180161161.gal : 12 ms
[2023-03-15 09:29:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9765661553943236525.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/ReachabilityFireability16966231441180161161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9765661553943236525.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/ReachabilityFireability9765661553943236525.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17414305183022204098
[2023-03-15 09:30:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17414305183022204098
Running compilation step : cd /tmp/ltsmin17414305183022204098;'/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 2788 ms.
Running link step : cd /tmp/ltsmin17414305183022204098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17414305183022204098;'/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:30:42] [INFO ] Flatten gal took : 57 ms
[2023-03-15 09:30:42] [INFO ] Flatten gal took : 55 ms
[2023-03-15 09:30:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability403327188440637112.gal : 7 ms
[2023-03-15 09:30:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6010674197936750306.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/ReachabilityFireability403327188440637112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6010674197936750306.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...318
Loading property file /tmp/ReachabilityFireability6010674197936750306.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8974 after 18882
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :18882 after 38905
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :38905 after 807312
Detected timeout of ITS tools.
[2023-03-15 09:35:42] [INFO ] Flatten gal took : 56 ms
[2023-03-15 09:35:42] [INFO ] Applying decomposition
[2023-03-15 09:35:42] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12618826246427547284.txt' '-o' '/tmp/graph12618826246427547284.bin' '-w' '/tmp/graph12618826246427547284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12618826246427547284.bin' '-l' '-1' '-v' '-w' '/tmp/graph12618826246427547284.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:35:43] [INFO ] Decomposing Gal with order
[2023-03-15 09:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:35:43] [INFO ] Removed a total of 1444 redundant transitions.
[2023-03-15 09:35:43] [INFO ] Flatten gal took : 150 ms
[2023-03-15 09:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 438 labels/synchronizations in 20 ms.
[2023-03-15 09:35:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1671049178685634032.gal : 10 ms
[2023-03-15 09:35:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability97096975940907668.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/ReachabilityFireability1671049178685634032.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability97096975940907668.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...296
Loading property file /tmp/ReachabilityFireability97096975940907668.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :66 after 67
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :67 after 81
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :81 after 216
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :216 after 1853
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1853 after 28928
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28928 after 5.28958e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.28958e+07 after 5.28958e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.28958e+07 after 5.28135e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.28135e+08 after 5.29605e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6406679222588959752
[2023-03-15 09:40:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6406679222588959752
Running compilation step : cd /tmp/ltsmin6406679222588959752;'/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 2923 ms.
Running link step : cd /tmp/ltsmin6406679222588959752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6406679222588959752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.050: There are 1427 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.050: State length is 1010, there are 1426 groups
pins2lts-mc-linux64( 0/ 8), 0.050: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.050: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.050: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.050: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.048: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.047: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.049: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.122: ~6 levels ~960 states ~5536 transitions
pins2lts-mc-linux64( 0/ 8), 0.152: ~6 levels ~1920 states ~6496 transitions
pins2lts-mc-linux64( 0/ 8), 0.287: ~6 levels ~3840 states ~8416 transitions
pins2lts-mc-linux64( 0/ 8), 1.257: ~7 levels ~7680 states ~321400 transitions
pins2lts-mc-linux64( 2/ 8), 1.646: ~2 levels ~15360 states ~202736 transitions
pins2lts-mc-linux64( 2/ 8), 2.460: ~2 levels ~30720 states ~248624 transitions
pins2lts-mc-linux64( 4/ 8), 4.060: ~3 levels ~61440 states ~406096 transitions
pins2lts-mc-linux64( 4/ 8), 6.894: ~4 levels ~122880 states ~587752 transitions
pins2lts-mc-linux64( 4/ 8), 12.424: ~4 levels ~245760 states ~947272 transitions
pins2lts-mc-linux64( 4/ 8), 23.534: ~5 levels ~491520 states ~1597424 transitions
pins2lts-mc-linux64( 4/ 8), 45.703: ~7 levels ~983040 states ~2286184 transitions
pins2lts-mc-linux64( 3/ 8), 92.112: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 93.443:
pins2lts-mc-linux64( 0/ 8), 93.443: mean standard work distribution: 28.9% (states) 58.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 93.443:
pins2lts-mc-linux64( 0/ 8), 93.443: Explored 1402821 states 48127323 transitions, fanout: 34.308
pins2lts-mc-linux64( 0/ 8), 93.443: Total exploration time 93.380 sec (92.060 sec minimum, 92.424 sec on average)
pins2lts-mc-linux64( 0/ 8), 93.443: States per second: 15023, Transitions per second: 515392
pins2lts-mc-linux64( 0/ 8), 93.443:
pins2lts-mc-linux64( 0/ 8), 93.443: Queue width: 8B, total height: 17371084, memory: 132.53MB
pins2lts-mc-linux64( 0/ 8), 93.443: Tree memory: 399.3MB, 22.3 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 93.443: Tree fill ratio (roots/leafs): 13.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 93.443: Stored 1453 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 93.443: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 93.443: Est. total memory use: 531.8MB (~1156.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6406679222588959752;'/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/ltsmin6406679222588959752;'/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:42:20] [INFO ] Flatten gal took : 66 ms
[2023-03-15 09:42:20] [INFO ] Flatten gal took : 105 ms
[2023-03-15 09:42:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9720252910713536237.gal : 23 ms
[2023-03-15 09:42:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15453888808084438194.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/ReachabilityFireability9720252910713536237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15453888808084438194.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/ReachabilityFireability15453888808084438194.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8974 after 18882
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :18882 after 38905

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J80"
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-S05J80, 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-167873970600417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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