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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 1678873611583

Running Version 202205111006
[2023-03-15 09:46:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 09:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:46:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 09:46:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 09:46:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 621 ms
[2023-03-15 09:46:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 23 ms.
[2023-03-15 09:46:53] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 173 ms.
[2023-03-15 09:46:53] [INFO ] Unfolded 38 HLPN properties in 5 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 09:46:53] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 09:46:53] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 09:46:53] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 31 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1294 ms. (steps per millisecond=7 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 179 ms. (steps per millisecond=5 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-15 09:46:56] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 09:46:56] [INFO ] Computed 152 place invariants in 251 ms
[2023-03-15 09:46:59] [INFO ] [Real]Absence check using 145 positive place invariants in 94 ms returned sat
[2023-03-15 09:46:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 09:47:01] [INFO ] After 2132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-15 09:47:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:47:02] [INFO ] After 357ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-15 09:47:02] [INFO ] After 688ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-15 09:47:02] [INFO ] After 4379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-15 09:47:03] [INFO ] [Nat]Absence check using 145 positive place invariants in 56 ms returned sat
[2023-03-15 09:47:03] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2023-03-15 09:47:27] [INFO ] After 23976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-15 09:47:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:47:27] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:15
Fused 17 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 164 ms.
Support contains 1065 out of 1234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 1220 transition count 2806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 1220 transition count 2805
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1217 transition count 2803
Applied a total of 24 rules in 331 ms. Remains 1217 /1234 variables (removed 17) and now considering 2803/2810 (removed 7) transitions.
[2023-03-15 09:47:28] [INFO ] Flow matrix only has 2794 transitions (discarded 9 similar events)
// Phase 1: matrix 2794 rows 1217 cols
[2023-03-15 09:47:28] [INFO ] Computed 142 place invariants in 158 ms
[2023-03-15 09:47:30] [INFO ] Dead Transitions using invariants and state equation in 1818 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 1217/1234 places, 2188/2810 transitions.
Applied a total of 0 rules in 50 ms. Remains 1217 /1217 variables (removed 0) and now considering 2188/2188 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1217/1234 places, 2188/2810 transitions.
Incomplete random walk after 1000000 steps, including 67088 resets, run finished after 8606 ms. (steps per millisecond=116 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 1000000 steps, including 9467 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:47:40] [INFO ] Flow matrix only has 2179 transitions (discarded 9 similar events)
// Phase 1: matrix 2179 rows 1217 cols
[2023-03-15 09:47:40] [INFO ] Computed 142 place invariants in 67 ms
[2023-03-15 09:47:40] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2023-03-15 09:47:41] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-15 09:47:41] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:47:41] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2023-03-15 09:47:41] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 30 ms returned sat
[2023-03-15 09:47:41] [INFO ] After 627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:47:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:47:42] [INFO ] After 511ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:47:43] [INFO ] Deduced a trap composed of 568 places in 580 ms of which 3 ms to minimize.
[2023-03-15 09:47:43] [INFO ] Deduced a trap composed of 560 places in 576 ms of which 7 ms to minimize.
[2023-03-15 09:47:44] [INFO ] Deduced a trap composed of 584 places in 548 ms of which 3 ms to minimize.
[2023-03-15 09:47:45] [INFO ] Deduced a trap composed of 576 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:47:45] [INFO ] Deduced a trap composed of 562 places in 571 ms of which 1 ms to minimize.
[2023-03-15 09:47:46] [INFO ] Deduced a trap composed of 562 places in 598 ms of which 1 ms to minimize.
[2023-03-15 09:47:47] [INFO ] Deduced a trap composed of 576 places in 570 ms of which 2 ms to minimize.
[2023-03-15 09:47:47] [INFO ] Deduced a trap composed of 574 places in 548 ms of which 1 ms to minimize.
[2023-03-15 09:47:48] [INFO ] Deduced a trap composed of 564 places in 613 ms of which 2 ms to minimize.
[2023-03-15 09:47:48] [INFO ] Deduced a trap composed of 572 places in 553 ms of which 1 ms to minimize.
[2023-03-15 09:47:49] [INFO ] Deduced a trap composed of 576 places in 545 ms of which 1 ms to minimize.
[2023-03-15 09:47:50] [INFO ] Deduced a trap composed of 572 places in 548 ms of which 2 ms to minimize.
[2023-03-15 09:47:50] [INFO ] Deduced a trap composed of 568 places in 564 ms of which 1 ms to minimize.
[2023-03-15 09:47:51] [INFO ] Deduced a trap composed of 570 places in 550 ms of which 1 ms to minimize.
[2023-03-15 09:47:52] [INFO ] Deduced a trap composed of 586 places in 571 ms of which 1 ms to minimize.
[2023-03-15 09:47:52] [INFO ] Deduced a trap composed of 566 places in 587 ms of which 2 ms to minimize.
[2023-03-15 09:47:53] [INFO ] Deduced a trap composed of 562 places in 608 ms of which 1 ms to minimize.
[2023-03-15 09:47:54] [INFO ] Deduced a trap composed of 560 places in 593 ms of which 1 ms to minimize.
[2023-03-15 09:47:54] [INFO ] Deduced a trap composed of 566 places in 568 ms of which 1 ms to minimize.
[2023-03-15 09:47:55] [INFO ] Deduced a trap composed of 572 places in 561 ms of which 1 ms to minimize.
[2023-03-15 09:48:04] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 22163 ms
[2023-03-15 09:48:04] [INFO ] After 22914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:48:04] [INFO ] After 23767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1217/1217 places, 2188/2188 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1217 transition count 2126
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 1155 transition count 2126
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 124 place count 1155 transition count 2062
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 252 place count 1091 transition count 2062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 1090 transition count 2061
Applied a total of 254 rules in 281 ms. Remains 1090 /1217 variables (removed 127) and now considering 2061/2188 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1217 places, 2061/2188 transitions.
Incomplete random walk after 1000000 steps, including 72771 resets, run finished after 11338 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7112 resets, run finished after 2011 ms. (steps per millisecond=497 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3762768 steps, run timeout after 39001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 3762768 steps, saw 629772 distinct states, run finished after 39002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:48:57] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:48:57] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 09:48:57] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 09:48:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:48:57] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:48:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-15 09:48:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 09:48:58] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:48:59] [INFO ] After 652ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:48:59] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:49:00] [INFO ] Deduced a trap composed of 444 places in 473 ms of which 1 ms to minimize.
[2023-03-15 09:49:00] [INFO ] Deduced a trap composed of 442 places in 439 ms of which 1 ms to minimize.
[2023-03-15 09:49:01] [INFO ] Deduced a trap composed of 438 places in 440 ms of which 1 ms to minimize.
[2023-03-15 09:49:01] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 0 ms to minimize.
[2023-03-15 09:49:02] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-15 09:49:03] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:49:04] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:49:04] [INFO ] Deduced a trap composed of 440 places in 449 ms of which 1 ms to minimize.
[2023-03-15 09:49:05] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2023-03-15 09:49:05] [INFO ] Deduced a trap composed of 438 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:49:06] [INFO ] Deduced a trap composed of 444 places in 433 ms of which 1 ms to minimize.
[2023-03-15 09:49:06] [INFO ] Deduced a trap composed of 442 places in 440 ms of which 1 ms to minimize.
[2023-03-15 09:49:07] [INFO ] Deduced a trap composed of 450 places in 441 ms of which 1 ms to minimize.
[2023-03-15 09:49:07] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2023-03-15 09:49:08] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:49:08] [INFO ] Deduced a trap composed of 448 places in 442 ms of which 1 ms to minimize.
[2023-03-15 09:49:09] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:49:09] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:49:10] [INFO ] Deduced a trap composed of 428 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:49:11] [INFO ] Deduced a trap composed of 440 places in 438 ms of which 0 ms to minimize.
[2023-03-15 09:49:12] [INFO ] Deduced a trap composed of 446 places in 430 ms of which 2 ms to minimize.
[2023-03-15 09:49:13] [INFO ] Deduced a trap composed of 434 places in 441 ms of which 1 ms to minimize.
[2023-03-15 09:49:14] [INFO ] Deduced a trap composed of 446 places in 431 ms of which 2 ms to minimize.
[2023-03-15 09:49:14] [INFO ] Deduced a trap composed of 454 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:49:16] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:49:17] [INFO ] Deduced a trap composed of 436 places in 431 ms of which 1 ms to minimize.
[2023-03-15 09:49:18] [INFO ] Deduced a trap composed of 444 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:49:20] [INFO ] Deduced a trap composed of 440 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:49:23] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:49:24] [INFO ] Deduced a trap composed of 436 places in 415 ms of which 1 ms to minimize.
[2023-03-15 09:49:26] [INFO ] Deduced a trap composed of 452 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:49:30] [INFO ] Deduced a trap composed of 440 places in 440 ms of which 1 ms to minimize.
[2023-03-15 09:49:31] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 0 ms to minimize.
[2023-03-15 09:49:40] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 41760 ms
[2023-03-15 09:49:41] [INFO ] After 42678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:49:41] [INFO ] After 43451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 59 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 09:49:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:49:41] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 09:49:42] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-15 09:49:42] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:49:42] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 09:49:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:49:49] [INFO ] Implicit Places using invariants and state equation in 7487 ms returned []
Implicit Place search using SMT with State Equation took 8372 ms to find 0 implicit places.
[2023-03-15 09:49:49] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-15 09:49:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:49:49] [INFO ] Computed 142 place invariants in 35 ms
[2023-03-15 09:49:50] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7294 resets, run finished after 1249 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:49:52] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:49:52] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-15 09:49:52] [INFO ] [Real]Absence check using 135 positive place invariants in 50 ms returned sat
[2023-03-15 09:49:52] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 09:49:52] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:49:52] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 09:49:52] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:49:53] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:49:53] [INFO ] After 667ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:49:54] [INFO ] Deduced a trap composed of 448 places in 435 ms of which 1 ms to minimize.
[2023-03-15 09:49:54] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 12 ms to minimize.
[2023-03-15 09:49:55] [INFO ] Deduced a trap composed of 442 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:49:55] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2023-03-15 09:49:56] [INFO ] Deduced a trap composed of 444 places in 434 ms of which 1 ms to minimize.
[2023-03-15 09:49:57] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2023-03-15 09:49:58] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 0 ms to minimize.
[2023-03-15 09:49:58] [INFO ] Deduced a trap composed of 440 places in 439 ms of which 1 ms to minimize.
[2023-03-15 09:49:59] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:49:59] [INFO ] Deduced a trap composed of 444 places in 433 ms of which 0 ms to minimize.
[2023-03-15 09:50:00] [INFO ] Deduced a trap composed of 438 places in 439 ms of which 4 ms to minimize.
[2023-03-15 09:50:00] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:50:01] [INFO ] Deduced a trap composed of 442 places in 442 ms of which 4 ms to minimize.
[2023-03-15 09:50:01] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 1 ms to minimize.
[2023-03-15 09:50:02] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:50:02] [INFO ] Deduced a trap composed of 448 places in 431 ms of which 1 ms to minimize.
[2023-03-15 09:50:03] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:50:03] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 0 ms to minimize.
[2023-03-15 09:50:04] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:50:05] [INFO ] Deduced a trap composed of 428 places in 416 ms of which 1 ms to minimize.
[2023-03-15 09:50:06] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:50:07] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-15 09:50:07] [INFO ] Deduced a trap composed of 434 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:50:08] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:50:09] [INFO ] Deduced a trap composed of 454 places in 420 ms of which 0 ms to minimize.
[2023-03-15 09:50:11] [INFO ] Deduced a trap composed of 444 places in 416 ms of which 1 ms to minimize.
[2023-03-15 09:50:11] [INFO ] Deduced a trap composed of 436 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:50:13] [INFO ] Deduced a trap composed of 444 places in 429 ms of which 1 ms to minimize.
[2023-03-15 09:50:14] [INFO ] Deduced a trap composed of 440 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:50:18] [INFO ] Deduced a trap composed of 444 places in 419 ms of which 0 ms to minimize.
[2023-03-15 09:50:18] [INFO ] Deduced a trap composed of 436 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:50:20] [INFO ] Deduced a trap composed of 452 places in 415 ms of which 1 ms to minimize.
[2023-03-15 09:50:24] [INFO ] Deduced a trap composed of 440 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:50:26] [INFO ] Deduced a trap composed of 442 places in 413 ms of which 1 ms to minimize.
[2023-03-15 09:50:35] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 41370 ms
[2023-03-15 09:50:35] [INFO ] After 42366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:50:35] [INFO ] After 43111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72477 resets, run finished after 11312 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7005 resets, run finished after 1980 ms. (steps per millisecond=505 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3889550 steps, run timeout after 39001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 3889550 steps, saw 652362 distinct states, run finished after 39001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:51:27] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:51:27] [INFO ] Computed 142 place invariants in 43 ms
[2023-03-15 09:51:28] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 09:51:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 09:51:28] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:51:28] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 09:51:28] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 09:51:28] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:51:29] [INFO ] After 674ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:51:29] [INFO ] Deduced a trap composed of 448 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:51:30] [INFO ] Deduced a trap composed of 444 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:51:31] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-15 09:51:31] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 1 ms to minimize.
[2023-03-15 09:51:32] [INFO ] Deduced a trap composed of 444 places in 449 ms of which 1 ms to minimize.
[2023-03-15 09:51:32] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-15 09:51:33] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:51:34] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 09:51:35] [INFO ] Deduced a trap composed of 440 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:51:35] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 0 ms to minimize.
[2023-03-15 09:51:36] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:51:36] [INFO ] Deduced a trap composed of 444 places in 432 ms of which 0 ms to minimize.
[2023-03-15 09:51:37] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:51:37] [INFO ] Deduced a trap composed of 450 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:51:38] [INFO ] Deduced a trap composed of 440 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:51:38] [INFO ] Deduced a trap composed of 448 places in 427 ms of which 0 ms to minimize.
[2023-03-15 09:51:39] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 0 ms to minimize.
[2023-03-15 09:51:39] [INFO ] Deduced a trap composed of 444 places in 413 ms of which 1 ms to minimize.
[2023-03-15 09:51:40] [INFO ] Deduced a trap composed of 442 places in 412 ms of which 0 ms to minimize.
[2023-03-15 09:51:40] [INFO ] Deduced a trap composed of 428 places in 419 ms of which 1 ms to minimize.
[2023-03-15 09:51:41] [INFO ] Deduced a trap composed of 440 places in 446 ms of which 1 ms to minimize.
[2023-03-15 09:51:42] [INFO ] Deduced a trap composed of 446 places in 442 ms of which 1 ms to minimize.
[2023-03-15 09:51:43] [INFO ] Deduced a trap composed of 434 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:51:44] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:51:44] [INFO ] Deduced a trap composed of 454 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:51:46] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:51:47] [INFO ] Deduced a trap composed of 436 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:51:48] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:51:50] [INFO ] Deduced a trap composed of 440 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:51:53] [INFO ] Deduced a trap composed of 444 places in 425 ms of which 0 ms to minimize.
[2023-03-15 09:51:54] [INFO ] Deduced a trap composed of 436 places in 412 ms of which 1 ms to minimize.
[2023-03-15 09:51:56] [INFO ] Deduced a trap composed of 452 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:52:00] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:52:01] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:52:10] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 41077 ms
[2023-03-15 09:52:10] [INFO ] After 42090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:52:10] [INFO ] After 42862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 49 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 09:52:11] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:52:11] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 09:52:11] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-15 09:52:11] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:52:11] [INFO ] Computed 142 place invariants in 34 ms
[2023-03-15 09:52:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:52:20] [INFO ] Implicit Places using invariants and state equation in 8264 ms returned []
Implicit Place search using SMT with State Equation took 9119 ms to find 0 implicit places.
[2023-03-15 09:52:20] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 09:52:20] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:52:20] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-15 09:52:21] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7239 resets, run finished after 1126 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:52:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:52:22] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 09:52:22] [INFO ] [Real]Absence check using 135 positive place invariants in 48 ms returned sat
[2023-03-15 09:52:22] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:52:22] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:52:22] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 09:52:22] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:52:23] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:52:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:52:24] [INFO ] After 640ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:52:24] [INFO ] Deduced a trap composed of 448 places in 419 ms of which 0 ms to minimize.
[2023-03-15 09:52:25] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:52:25] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:52:26] [INFO ] Deduced a trap composed of 438 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:52:26] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:52:27] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:52:28] [INFO ] Deduced a trap composed of 442 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:52:28] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:52:29] [INFO ] Deduced a trap composed of 440 places in 428 ms of which 0 ms to minimize.
[2023-03-15 09:52:29] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:52:30] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-15 09:52:30] [INFO ] Deduced a trap composed of 444 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:52:31] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:52:31] [INFO ] Deduced a trap composed of 450 places in 432 ms of which 0 ms to minimize.
[2023-03-15 09:52:32] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:52:32] [INFO ] Deduced a trap composed of 448 places in 429 ms of which 1 ms to minimize.
[2023-03-15 09:52:33] [INFO ] Deduced a trap composed of 448 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:52:33] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:52:34] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:52:35] [INFO ] Deduced a trap composed of 428 places in 424 ms of which 0 ms to minimize.
[2023-03-15 09:52:36] [INFO ] Deduced a trap composed of 440 places in 435 ms of which 1 ms to minimize.
[2023-03-15 09:52:37] [INFO ] Deduced a trap composed of 446 places in 428 ms of which 1 ms to minimize.
[2023-03-15 09:52:37] [INFO ] Deduced a trap composed of 434 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:52:38] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:52:39] [INFO ] Deduced a trap composed of 454 places in 432 ms of which 0 ms to minimize.
[2023-03-15 09:52:41] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-15 09:52:41] [INFO ] Deduced a trap composed of 436 places in 432 ms of which 0 ms to minimize.
[2023-03-15 09:52:43] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:52:44] [INFO ] Deduced a trap composed of 440 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:52:48] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:52:48] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:52:50] [INFO ] Deduced a trap composed of 452 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:52:54] [INFO ] Deduced a trap composed of 440 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:52:56] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:53:05] [INFO ] Trap strengthening (SAT) tested/added 34/34 trap constraints in 40972 ms
[2023-03-15 09:53:05] [INFO ] After 41853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:53:05] [INFO ] After 42592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 727 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292007 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292007 steps, saw 47805 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:53:08] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:53:08] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-15 09:53:08] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 09:53:08] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:53:08] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:53:08] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 09:53:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:53:09] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:53:10] [INFO ] After 774ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:10] [INFO ] Deduced a trap composed of 438 places in 414 ms of which 1 ms to minimize.
[2023-03-15 09:53:11] [INFO ] Deduced a trap composed of 434 places in 412 ms of which 1 ms to minimize.
[2023-03-15 09:53:11] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:53:12] [INFO ] Deduced a trap composed of 438 places in 436 ms of which 0 ms to minimize.
[2023-03-15 09:53:12] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:53:13] [INFO ] Deduced a trap composed of 446 places in 415 ms of which 1 ms to minimize.
[2023-03-15 09:53:13] [INFO ] Deduced a trap composed of 450 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:53:14] [INFO ] Deduced a trap composed of 446 places in 417 ms of which 0 ms to minimize.
[2023-03-15 09:53:15] [INFO ] Deduced a trap composed of 442 places in 414 ms of which 1 ms to minimize.
[2023-03-15 09:53:15] [INFO ] Deduced a trap composed of 436 places in 412 ms of which 1 ms to minimize.
[2023-03-15 09:53:16] [INFO ] Deduced a trap composed of 432 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:53:16] [INFO ] Deduced a trap composed of 452 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:53:17] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 0 ms to minimize.
[2023-03-15 09:53:17] [INFO ] Deduced a trap composed of 442 places in 440 ms of which 1 ms to minimize.
[2023-03-15 09:53:18] [INFO ] Deduced a trap composed of 440 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:53:18] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 0 ms to minimize.
[2023-03-15 09:53:19] [INFO ] Deduced a trap composed of 438 places in 413 ms of which 1 ms to minimize.
[2023-03-15 09:53:19] [INFO ] Deduced a trap composed of 440 places in 438 ms of which 1 ms to minimize.
[2023-03-15 09:53:20] [INFO ] Deduced a trap composed of 445 places in 424 ms of which 0 ms to minimize.
[2023-03-15 09:53:21] [INFO ] Deduced a trap composed of 442 places in 449 ms of which 0 ms to minimize.
[2023-03-15 09:53:21] [INFO ] Deduced a trap composed of 440 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:53:22] [INFO ] Deduced a trap composed of 444 places in 416 ms of which 0 ms to minimize.
[2023-03-15 09:53:24] [INFO ] Deduced a trap composed of 446 places in 429 ms of which 0 ms to minimize.
[2023-03-15 09:53:24] [INFO ] Deduced a trap composed of 430 places in 427 ms of which 0 ms to minimize.
[2023-03-15 09:53:25] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-15 09:53:26] [INFO ] Deduced a trap composed of 451 places in 439 ms of which 1 ms to minimize.
[2023-03-15 09:53:27] [INFO ] Deduced a trap composed of 438 places in 445 ms of which 1 ms to minimize.
[2023-03-15 09:53:30] [INFO ] Deduced a trap composed of 442 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:53:30] [INFO ] Deduced a trap composed of 456 places in 431 ms of which 1 ms to minimize.
[2023-03-15 09:53:32] [INFO ] Deduced a trap composed of 428 places in 456 ms of which 1 ms to minimize.
[2023-03-15 09:53:33] [INFO ] Deduced a trap composed of 436 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:53:33] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:53:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:53:33] [INFO ] After 25291ms 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 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 50 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 09:53:34] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:53:34] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 09:53:35] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 721 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289956 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289956 steps, saw 47514 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:53:38] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:53:38] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 09:53:38] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 09:53:38] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 09:53:38] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:53:38] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 09:53:38] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:53:39] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:53:40] [INFO ] After 777ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:53:40] [INFO ] Deduced a trap composed of 438 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:53:40] [INFO ] Deduced a trap composed of 434 places in 417 ms of which 0 ms to minimize.
[2023-03-15 09:53:41] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:53:41] [INFO ] Deduced a trap composed of 438 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:53:42] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:53:43] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:53:43] [INFO ] Deduced a trap composed of 450 places in 429 ms of which 1 ms to minimize.
[2023-03-15 09:53:44] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:53:44] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:53:45] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:53:45] [INFO ] Deduced a trap composed of 432 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:53:46] [INFO ] Deduced a trap composed of 452 places in 431 ms of which 1 ms to minimize.
[2023-03-15 09:53:47] [INFO ] Deduced a trap composed of 440 places in 439 ms of which 0 ms to minimize.
[2023-03-15 09:53:47] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:53:48] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 09:53:48] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 0 ms to minimize.
[2023-03-15 09:53:49] [INFO ] Deduced a trap composed of 438 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:53:49] [INFO ] Deduced a trap composed of 440 places in 451 ms of which 1 ms to minimize.
[2023-03-15 09:53:50] [INFO ] Deduced a trap composed of 445 places in 436 ms of which 1 ms to minimize.
[2023-03-15 09:53:51] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-15 09:53:51] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:53:52] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:53:54] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2023-03-15 09:53:54] [INFO ] Deduced a trap composed of 430 places in 427 ms of which 1 ms to minimize.
[2023-03-15 09:53:55] [INFO ] Deduced a trap composed of 438 places in 467 ms of which 1 ms to minimize.
[2023-03-15 09:53:56] [INFO ] Deduced a trap composed of 451 places in 447 ms of which 1 ms to minimize.
[2023-03-15 09:53:56] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-15 09:53:59] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-15 09:54:00] [INFO ] Deduced a trap composed of 456 places in 426 ms of which 1 ms to minimize.
[2023-03-15 09:54:02] [INFO ] Deduced a trap composed of 428 places in 448 ms of which 1 ms to minimize.
[2023-03-15 09:54:03] [INFO ] Deduced a trap composed of 436 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:54:03] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 1 ms to minimize.
[2023-03-15 09:54:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:54:03] [INFO ] After 25290ms 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 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 09:54:03] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:54:03] [INFO ] Computed 142 place invariants in 49 ms
[2023-03-15 09:54:04] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-15 09:54:04] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:54:04] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-15 09:54:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 09:54:12] [INFO ] Implicit Places using invariants and state equation in 7787 ms returned []
Implicit Place search using SMT with State Equation took 8698 ms to find 0 implicit places.
[2023-03-15 09:54:12] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-15 09:54:12] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 09:54:12] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-15 09:54:13] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 226 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2023-03-15 09:54:14] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 09:54:14] [INFO ] [Real]Absence check using 135 positive place invariants in 43 ms returned sat
[2023-03-15 09:54:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:54:14] [INFO ] After 514ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:54:15] [INFO ] Deduced a trap composed of 438 places in 394 ms of which 1 ms to minimize.
[2023-03-15 09:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2023-03-15 09:54:15] [INFO ] After 1078ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:54:15] [INFO ] After 1269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:54:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 09:54:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:54:16] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:54:16] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2023-03-15 09:54:16] [INFO ] Deduced a trap composed of 438 places in 404 ms of which 1 ms to minimize.
[2023-03-15 09:54:17] [INFO ] Deduced a trap composed of 438 places in 391 ms of which 1 ms to minimize.
[2023-03-15 09:54:17] [INFO ] Deduced a trap composed of 436 places in 405 ms of which 0 ms to minimize.
[2023-03-15 09:54:18] [INFO ] Deduced a trap composed of 430 places in 408 ms of which 1 ms to minimize.
[2023-03-15 09:54:18] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:54:19] [INFO ] Deduced a trap composed of 434 places in 404 ms of which 1 ms to minimize.
[2023-03-15 09:54:19] [INFO ] Deduced a trap composed of 444 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:54:20] [INFO ] Deduced a trap composed of 444 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:54:20] [INFO ] Deduced a trap composed of 444 places in 412 ms of which 2 ms to minimize.
[2023-03-15 09:54:21] [INFO ] Deduced a trap composed of 442 places in 389 ms of which 1 ms to minimize.
[2023-03-15 09:54:21] [INFO ] Deduced a trap composed of 434 places in 388 ms of which 1 ms to minimize.
[2023-03-15 09:54:22] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2023-03-15 09:54:22] [INFO ] Deduced a trap composed of 424 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:23] [INFO ] Deduced a trap composed of 438 places in 393 ms of which 0 ms to minimize.
[2023-03-15 09:54:23] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 0 ms to minimize.
[2023-03-15 09:54:23] [INFO ] Deduced a trap composed of 446 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:54:24] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:24] [INFO ] Deduced a trap composed of 458 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:54:25] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:25] [INFO ] Deduced a trap composed of 444 places in 393 ms of which 1 ms to minimize.
[2023-03-15 09:54:26] [INFO ] Deduced a trap composed of 446 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:54:26] [INFO ] Deduced a trap composed of 444 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:54:27] [INFO ] Deduced a trap composed of 434 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:27] [INFO ] Deduced a trap composed of 440 places in 402 ms of which 1 ms to minimize.
[2023-03-15 09:54:28] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2023-03-15 09:54:28] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 2 ms to minimize.
[2023-03-15 09:54:29] [INFO ] Deduced a trap composed of 436 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:54:29] [INFO ] Deduced a trap composed of 436 places in 418 ms of which 0 ms to minimize.
[2023-03-15 09:54:30] [INFO ] Deduced a trap composed of 442 places in 407 ms of which 1 ms to minimize.
[2023-03-15 09:54:30] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:54:30] [INFO ] Deduced a trap composed of 438 places in 404 ms of which 1 ms to minimize.
[2023-03-15 09:54:31] [INFO ] Deduced a trap composed of 442 places in 407 ms of which 0 ms to minimize.
[2023-03-15 09:54:31] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 0 ms to minimize.
[2023-03-15 09:54:32] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:54:32] [INFO ] Deduced a trap composed of 444 places in 406 ms of which 1 ms to minimize.
[2023-03-15 09:54:33] [INFO ] Deduced a trap composed of 444 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:33] [INFO ] Deduced a trap composed of 448 places in 393 ms of which 1 ms to minimize.
[2023-03-15 09:54:34] [INFO ] Deduced a trap composed of 448 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:54:34] [INFO ] Deduced a trap composed of 434 places in 421 ms of which 1 ms to minimize.
[2023-03-15 09:54:35] [INFO ] Deduced a trap composed of 434 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:54:35] [INFO ] Deduced a trap composed of 442 places in 406 ms of which 1 ms to minimize.
[2023-03-15 09:54:36] [INFO ] Deduced a trap composed of 440 places in 392 ms of which 1 ms to minimize.
[2023-03-15 09:54:36] [INFO ] Deduced a trap composed of 434 places in 391 ms of which 1 ms to minimize.
[2023-03-15 09:54:37] [INFO ] Deduced a trap composed of 444 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:54:37] [INFO ] Deduced a trap composed of 450 places in 392 ms of which 1 ms to minimize.
[2023-03-15 09:54:38] [INFO ] Deduced a trap composed of 436 places in 395 ms of which 1 ms to minimize.
[2023-03-15 09:54:38] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:38] [INFO ] Deduced a trap composed of 430 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:54:39] [INFO ] Deduced a trap composed of 436 places in 387 ms of which 1 ms to minimize.
[2023-03-15 09:54:39] [INFO ] Deduced a trap composed of 454 places in 390 ms of which 1 ms to minimize.
[2023-03-15 09:54:40] [INFO ] Deduced a trap composed of 426 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:54:40] [INFO ] Deduced a trap composed of 442 places in 394 ms of which 1 ms to minimize.
[2023-03-15 09:54:41] [INFO ] Deduced a trap composed of 440 places in 394 ms of which 1 ms to minimize.
[2023-03-15 09:54:45] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 09:54:46] [INFO ] Deduced a trap composed of 454 places in 394 ms of which 1 ms to minimize.
[2023-03-15 09:54:46] [INFO ] Deduced a trap composed of 436 places in 410 ms of which 1 ms to minimize.
[2023-03-15 09:54:47] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:54:47] [INFO ] Deduced a trap composed of 440 places in 391 ms of which 1 ms to minimize.
[2023-03-15 09:54:48] [INFO ] Deduced a trap composed of 450 places in 395 ms of which 0 ms to minimize.
[2023-03-15 09:54:49] [INFO ] Deduced a trap composed of 446 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:54:58] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 42574 ms
[2023-03-15 09:54:58] [INFO ] After 43282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:54:58] [INFO ] After 43477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
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 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 188 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2023-03-15 09:54:59] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 09:54:59] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 09:54:59] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 09:54:59] [INFO ] After 547ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 09:55:00] [INFO ] Deduced a trap composed of 438 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2023-03-15 09:55:00] [INFO ] After 1119ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:55:00] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:55:00] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 09:55:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 09:55:01] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:55:01] [INFO ] Deduced a trap composed of 438 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:55:01] [INFO ] Deduced a trap composed of 438 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:55:02] [INFO ] Deduced a trap composed of 438 places in 407 ms of which 1 ms to minimize.
[2023-03-15 09:55:02] [INFO ] Deduced a trap composed of 436 places in 407 ms of which 1 ms to minimize.
[2023-03-15 09:55:03] [INFO ] Deduced a trap composed of 430 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:55:03] [INFO ] Deduced a trap composed of 446 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:55:04] [INFO ] Deduced a trap composed of 434 places in 390 ms of which 1 ms to minimize.
[2023-03-15 09:55:04] [INFO ] Deduced a trap composed of 444 places in 405 ms of which 0 ms to minimize.
[2023-03-15 09:55:05] [INFO ] Deduced a trap composed of 444 places in 404 ms of which 1 ms to minimize.
[2023-03-15 09:55:05] [INFO ] Deduced a trap composed of 444 places in 402 ms of which 1 ms to minimize.
[2023-03-15 09:55:06] [INFO ] Deduced a trap composed of 442 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:55:06] [INFO ] Deduced a trap composed of 434 places in 400 ms of which 2 ms to minimize.
[2023-03-15 09:55:07] [INFO ] Deduced a trap composed of 440 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:55:07] [INFO ] Deduced a trap composed of 424 places in 410 ms of which 1 ms to minimize.
[2023-03-15 09:55:08] [INFO ] Deduced a trap composed of 438 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:55:08] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:55:08] [INFO ] Deduced a trap composed of 446 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:55:09] [INFO ] Deduced a trap composed of 440 places in 412 ms of which 1 ms to minimize.
[2023-03-15 09:55:09] [INFO ] Deduced a trap composed of 458 places in 407 ms of which 1 ms to minimize.
[2023-03-15 09:55:10] [INFO ] Deduced a trap composed of 442 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:55:10] [INFO ] Deduced a trap composed of 444 places in 409 ms of which 1 ms to minimize.
[2023-03-15 09:55:11] [INFO ] Deduced a trap composed of 446 places in 395 ms of which 0 ms to minimize.
[2023-03-15 09:55:11] [INFO ] Deduced a trap composed of 444 places in 410 ms of which 1 ms to minimize.
[2023-03-15 09:55:12] [INFO ] Deduced a trap composed of 434 places in 405 ms of which 0 ms to minimize.
[2023-03-15 09:55:12] [INFO ] Deduced a trap composed of 440 places in 418 ms of which 1 ms to minimize.
[2023-03-15 09:55:13] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 0 ms to minimize.
[2023-03-15 09:55:13] [INFO ] Deduced a trap composed of 438 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:55:14] [INFO ] Deduced a trap composed of 436 places in 395 ms of which 1 ms to minimize.
[2023-03-15 09:55:14] [INFO ] Deduced a trap composed of 436 places in 388 ms of which 1 ms to minimize.
[2023-03-15 09:55:15] [INFO ] Deduced a trap composed of 442 places in 391 ms of which 1 ms to minimize.
[2023-03-15 09:55:15] [INFO ] Deduced a trap composed of 438 places in 407 ms of which 0 ms to minimize.
[2023-03-15 09:55:15] [INFO ] Deduced a trap composed of 438 places in 389 ms of which 1 ms to minimize.
[2023-03-15 09:55:16] [INFO ] Deduced a trap composed of 442 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:55:16] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:17] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:17] [INFO ] Deduced a trap composed of 444 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:55:18] [INFO ] Deduced a trap composed of 444 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:55:18] [INFO ] Deduced a trap composed of 448 places in 400 ms of which 1 ms to minimize.
[2023-03-15 09:55:19] [INFO ] Deduced a trap composed of 448 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:55:19] [INFO ] Deduced a trap composed of 434 places in 403 ms of which 0 ms to minimize.
[2023-03-15 09:55:20] [INFO ] Deduced a trap composed of 434 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:55:20] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:55:21] [INFO ] Deduced a trap composed of 440 places in 405 ms of which 0 ms to minimize.
[2023-03-15 09:55:21] [INFO ] Deduced a trap composed of 434 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:55:22] [INFO ] Deduced a trap composed of 444 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:22] [INFO ] Deduced a trap composed of 450 places in 397 ms of which 0 ms to minimize.
[2023-03-15 09:55:23] [INFO ] Deduced a trap composed of 436 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:55:23] [INFO ] Deduced a trap composed of 442 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:23] [INFO ] Deduced a trap composed of 430 places in 402 ms of which 1 ms to minimize.
[2023-03-15 09:55:24] [INFO ] Deduced a trap composed of 436 places in 399 ms of which 1 ms to minimize.
[2023-03-15 09:55:24] [INFO ] Deduced a trap composed of 454 places in 402 ms of which 1 ms to minimize.
[2023-03-15 09:55:25] [INFO ] Deduced a trap composed of 426 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:55:25] [INFO ] Deduced a trap composed of 442 places in 393 ms of which 1 ms to minimize.
[2023-03-15 09:55:26] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 0 ms to minimize.
[2023-03-15 09:55:30] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:31] [INFO ] Deduced a trap composed of 454 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:31] [INFO ] Deduced a trap composed of 436 places in 407 ms of which 1 ms to minimize.
[2023-03-15 09:55:32] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:32] [INFO ] Deduced a trap composed of 440 places in 398 ms of which 1 ms to minimize.
[2023-03-15 09:55:33] [INFO ] Deduced a trap composed of 450 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:55:34] [INFO ] Deduced a trap composed of 446 places in 403 ms of which 1 ms to minimize.
[2023-03-15 09:55:43] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 42574 ms
[2023-03-15 09:55:43] [INFO ] After 43276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:55:43] [INFO ] After 43470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 09:55:44] [INFO ] Flatten gal took : 244 ms
[2023-03-15 09:55:44] [INFO ] Flatten gal took : 147 ms
[2023-03-15 09:55:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8087841889214129517.gal : 39 ms
[2023-03-15 09:55:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15103200243171237952.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/ReachabilityFireability8087841889214129517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15103200243171237952.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/ReachabilityFireability15103200243171237952.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2023-03-15 09:55:47] [INFO ] Flatten gal took : 113 ms
[2023-03-15 09:55:47] [INFO ] Applying decomposition
[2023-03-15 09:55:47] [INFO ] Flatten gal took : 103 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/graph10857454227443466926.txt' '-o' '/tmp/graph10857454227443466926.bin' '-w' '/tmp/graph10857454227443466926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10857454227443466926.bin' '-l' '-1' '-v' '-w' '/tmp/graph10857454227443466926.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:55:47] [INFO ] Decomposing Gal with order
[2023-03-15 09:55:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:55:48] [INFO ] Removed a total of 4062 redundant transitions.
[2023-03-15 09:55:48] [INFO ] Flatten gal took : 744 ms
[2023-03-15 09:55:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 555 labels/synchronizations in 100 ms.
[2023-03-15 09:55:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1391277518079477243.gal : 22 ms
[2023-03-15 09:55:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7719757906388243718.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/ReachabilityFireability1391277518079477243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7719757906388243718.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability7719757906388243718.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8151496737598164476
[2023-03-15 09:55:52] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8151496737598164476
Running compilation step : cd /tmp/ltsmin8151496737598164476;'/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/ltsmin8151496737598164476;'/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/ltsmin8151496737598164476;'/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:55:54] [INFO ] Flatten gal took : 97 ms
[2023-03-15 09:55:54] [INFO ] Flatten gal took : 92 ms
[2023-03-15 09:55:54] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12800882604669130860.gal : 10 ms
[2023-03-15 09:55:54] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12254334258430179265.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/ReachabilityFireability12800882604669130860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12254334258430179265.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityFireability12254334258430179265.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
Detected timeout of ITS tools.
[2023-03-15 09:56:24] [INFO ] Flatten gal took : 84 ms
[2023-03-15 09:56:24] [INFO ] Applying decomposition
[2023-03-15 09:56:24] [INFO ] Flatten gal took : 84 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/graph15590339448342327341.txt' '-o' '/tmp/graph15590339448342327341.bin' '-w' '/tmp/graph15590339448342327341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15590339448342327341.bin' '-l' '-1' '-v' '-w' '/tmp/graph15590339448342327341.weights' '-q' '0' '-e' '0.001'
[2023-03-15 09:56:24] [INFO ] Decomposing Gal with order
[2023-03-15 09:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 09:56:25] [INFO ] Removed a total of 4240 redundant transitions.
[2023-03-15 09:56:25] [INFO ] Flatten gal took : 267 ms
[2023-03-15 09:56:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 58 ms.
[2023-03-15 09:56:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11362796531587296557.gal : 18 ms
[2023-03-15 09:56:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11424126947328222206.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/ReachabilityFireability11362796531587296557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11424126947328222206.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...300
Loading property file /tmp/ReachabilityFireability11424126947328222206.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1 after 5.4925e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.4925e+08 after 5.4925e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9683785169857169986
[2023-03-15 09:56:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9683785169857169986
Running compilation step : cd /tmp/ltsmin9683785169857169986;'/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 4355 ms.
Running link step : cd /tmp/ltsmin9683785169857169986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9683785169857169986;'/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:57:25] [INFO ] Flatten gal took : 84 ms
[2023-03-15 09:57:25] [INFO ] Flatten gal took : 84 ms
[2023-03-15 09:57:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7124905526121777405.gal : 9 ms
[2023-03-15 09:57:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4352701297708417969.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/ReachabilityFireability7124905526121777405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4352701297708417969.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/ReachabilityFireability4352701297708417969.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :256335 after 502724
Detected timeout of ITS tools.
[2023-03-15 10:02:25] [INFO ] Flatten gal took : 81 ms
[2023-03-15 10:02:25] [INFO ] Applying decomposition
[2023-03-15 10:02:25] [INFO ] Flatten gal took : 82 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/graph5024591119509887198.txt' '-o' '/tmp/graph5024591119509887198.bin' '-w' '/tmp/graph5024591119509887198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5024591119509887198.bin' '-l' '-1' '-v' '-w' '/tmp/graph5024591119509887198.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:02:26] [INFO ] Decomposing Gal with order
[2023-03-15 10:02:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:02:26] [INFO ] Removed a total of 4060 redundant transitions.
[2023-03-15 10:02:26] [INFO ] Flatten gal took : 223 ms
[2023-03-15 10:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 549 labels/synchronizations in 38 ms.
[2023-03-15 10:02:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16192800765996394710.gal : 33 ms
[2023-03-15 10:02:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10528142630251654274.prop : 17 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/ReachabilityFireability16192800765996394710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10528142630251654274.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...300
Loading property file /tmp/ReachabilityFireability10528142630251654274.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 10116
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10116 after 10116
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10116 after 10116
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10116 after 10116
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10116 after 10120
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :10120 after 14926
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14926 after 14926
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :14926 after 14926
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :14926 after 16146
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :16146 after 129538
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :129538 after 129538
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :129538 after 231954
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :231954 after 485650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18232838063987755690
[2023-03-15 10:07:26] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18232838063987755690
Running compilation step : cd /tmp/ltsmin18232838063987755690;'/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 4395 ms.
Running link step : cd /tmp/ltsmin18232838063987755690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18232838063987755690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.054: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.054: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.054: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.056: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.055: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.057: There are 2062 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.057: State length is 1090, there are 2061 groups
pins2lts-mc-linux64( 0/ 8), 0.057: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.057: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.057: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.057: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.056: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.056: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.382: ~4 levels ~960 states ~6904 transitions
pins2lts-mc-linux64( 0/ 8), 0.528: ~6 levels ~1920 states ~15264 transitions
pins2lts-mc-linux64( 0/ 8), 0.749: ~6 levels ~3840 states ~27336 transitions
pins2lts-mc-linux64( 1/ 8), 1.326: ~5 levels ~7680 states ~111968 transitions
pins2lts-mc-linux64( 1/ 8), 2.479: ~5 levels ~15360 states ~551168 transitions
pins2lts-mc-linux64( 1/ 8), 4.141: ~5 levels ~30720 states ~1429568 transitions
pins2lts-mc-linux64( 1/ 8), 7.098: ~6 levels ~61440 states ~3379624 transitions
pins2lts-mc-linux64( 0/ 8), 11.862: ~8 levels ~122880 states ~4724648 transitions
pins2lts-mc-linux64( 0/ 8), 22.084: ~8 levels ~245760 states ~9232936 transitions
pins2lts-mc-linux64( 0/ 8), 38.931: ~9 levels ~491520 states ~10132264 transitions
pins2lts-mc-linux64( 0/ 8), 72.547: ~9 levels ~983040 states ~11591632 transitions
pins2lts-mc-linux64( 1/ 8), 140.620: ~7 levels ~1966080 states ~16373504 transitions
pins2lts-mc-linux64( 2/ 8), 168.972: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 170.439:
pins2lts-mc-linux64( 0/ 8), 170.439: mean standard work distribution: 20.6% (states) 37.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 170.439:
pins2lts-mc-linux64( 0/ 8), 170.439: Explored 1978093 states 47235453 transitions, fanout: 23.879
pins2lts-mc-linux64( 0/ 8), 170.439: Total exploration time 170.370 sec (168.930 sec minimum, 169.322 sec on average)
pins2lts-mc-linux64( 0/ 8), 170.439: States per second: 11611, Transitions per second: 277252
pins2lts-mc-linux64( 0/ 8), 170.439:
pins2lts-mc-linux64( 0/ 8), 170.439: Queue width: 8B, total height: 17050948, memory: 130.09MB
pins2lts-mc-linux64( 0/ 8), 170.439: Tree memory: 401.2MB, 22.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 170.439: Tree fill ratio (roots/leafs): 14.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 170.439: Stored 2167 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 170.439: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 170.439: Est. total memory use: 531.3MB (~1154.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18232838063987755690;'/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/ltsmin18232838063987755690;'/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 10:10:21] [INFO ] Flatten gal took : 82 ms
[2023-03-15 10:10:21] [INFO ] Flatten gal took : 80 ms
[2023-03-15 10:10:21] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7512313307025892547.gal : 10 ms
[2023-03-15 10:10:21] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17447137616435971382.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/ReachabilityFireability7512313307025892547.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17447137616435971382.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/ReachabilityFireability17447137616435971382.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :256335 after 502724

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-S10J60"
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-S10J60, 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-167873970600437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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