Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872500182.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 8.8K May 30 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 30 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 30 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 30 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 30 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 30 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 30 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 12M May 29 12:20 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654796299092

Running Version 202205111006
[2022-06-09 17:38:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-09 17:38:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:38:22] [INFO ] Load time of PNML (sax parser for PT used): 1131 ms
[2022-06-09 17:38:22] [INFO ] Transformed 2443 places.
[2022-06-09 17:38:22] [INFO ] Transformed 15956 transitions.
[2022-06-09 17:38:22] [INFO ] Found NUPN structural information;
[2022-06-09 17:38:22] [INFO ] Parsed PT model containing 2443 places and 15956 transitions in 1424 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 293 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15956 rows 2443 cols
[2022-06-09 17:38:25] [INFO ] Computed 9 place invariants in 501 ms
[2022-06-09 17:38:27] [INFO ] After 1912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-09 17:38:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 28 ms returned sat
[2022-06-09 17:38:50] [INFO ] After 20485ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2022-06-09 17:39:03] [INFO ] Deduced a trap composed of 396 places in 11911 ms of which 13 ms to minimize.
[2022-06-09 17:39:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-09 17:39:03] [INFO ] After 35164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 18840 ms.
Support contains 123 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2199 edges and 2443 vertex of which 138 / 2443 are part of one of the 22 SCC in 17 ms
Free SCC test removed 116 places
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 4009 edges and 2327 vertex of which 2311 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.96 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1590 transitions
Trivial Post-agglo rules discarded 1590 transitions
Performed 1590 trivial Post agglomeration. Transition count delta: 1590
Iterating post reduction 0 with 1597 rules applied. Total rules applied 1599 place count 2311 transition count 14203
Reduce places removed 1590 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 1623 rules applied. Total rules applied 3222 place count 721 transition count 14170
Reduce places removed 14 places and 0 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Iterating post reduction 2 with 98 rules applied. Total rules applied 3320 place count 707 transition count 14086
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 87 rules applied. Total rules applied 3407 place count 623 transition count 14083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3408 place count 622 transition count 14083
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 91 Pre rules applied. Total rules applied 3408 place count 622 transition count 13992
Deduced a syphon composed of 91 places in 15 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 3590 place count 531 transition count 13992
Discarding 76 places :
Symmetric choice reduction at 5 with 76 rule applications. Total rules 3666 place count 455 transition count 13916
Iterating global reduction 5 with 76 rules applied. Total rules applied 3742 place count 455 transition count 13916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3742 place count 455 transition count 13915
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3744 place count 454 transition count 13915
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 3779 place count 419 transition count 1525
Iterating global reduction 5 with 35 rules applied. Total rules applied 3814 place count 419 transition count 1525
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3824 place count 419 transition count 1515
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 3831 place count 412 transition count 1508
Iterating global reduction 6 with 7 rules applied. Total rules applied 3838 place count 412 transition count 1508
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 3843 place count 407 transition count 1503
Iterating global reduction 6 with 5 rules applied. Total rules applied 3848 place count 407 transition count 1503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3850 place count 407 transition count 1501
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 3916 place count 374 transition count 1468
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3923 place count 367 transition count 1461
Iterating global reduction 7 with 7 rules applied. Total rules applied 3930 place count 367 transition count 1461
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3936 place count 361 transition count 1455
Iterating global reduction 7 with 6 rules applied. Total rules applied 3942 place count 361 transition count 1455
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3948 place count 355 transition count 1449
Iterating global reduction 7 with 6 rules applied. Total rules applied 3954 place count 355 transition count 1449
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3962 place count 351 transition count 1467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3964 place count 351 transition count 1465
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3968 place count 351 transition count 1461
Free-agglomeration rule applied 67 times.
Iterating global reduction 8 with 67 rules applied. Total rules applied 4035 place count 351 transition count 1394
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 8 with 67 rules applied. Total rules applied 4102 place count 284 transition count 1394
Drop transitions removed 249 transitions
Redundant transition composition rules discarded 249 transitions
Iterating global reduction 9 with 249 rules applied. Total rules applied 4351 place count 284 transition count 1145
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 4361 place count 284 transition count 1145
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 4368 place count 284 transition count 1138
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 4370 place count 284 transition count 1138
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 4378 place count 284 transition count 1130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4379 place count 283 transition count 1129
Applied a total of 4379 rules in 4970 ms. Remains 283 /2443 variables (removed 2160) and now considering 1129/15956 (removed 14827) transitions.
Finished structural reductions, in 1 iterations. Remains : 283/2443 places, 1129/15956 transitions.
Incomplete random walk after 1000000 steps, including 36448 resets, run finished after 27272 ms. (steps per millisecond=36 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4160 resets, run finished after 4377 ms. (steps per millisecond=228 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4181 resets, run finished after 4914 ms. (steps per millisecond=203 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4144 resets, run finished after 3680 ms. (steps per millisecond=271 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4146 resets, run finished after 4734 ms. (steps per millisecond=211 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4134 resets, run finished after 3647 ms. (steps per millisecond=274 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4147 resets, run finished after 3807 ms. (steps per millisecond=262 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1129 rows 283 cols
[2022-06-09 17:40:19] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 17:40:19] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-09 17:40:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 17:40:20] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-09 17:40:20] [INFO ] State equation strengthened by 678 read => feed constraints.
[2022-06-09 17:40:21] [INFO ] After 748ms SMT Verify possible using 678 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-09 17:40:22] [INFO ] Deduced a trap composed of 46 places in 735 ms of which 3 ms to minimize.
[2022-06-09 17:40:23] [INFO ] Deduced a trap composed of 38 places in 785 ms of which 3 ms to minimize.
[2022-06-09 17:40:24] [INFO ] Deduced a trap composed of 47 places in 806 ms of which 3 ms to minimize.
[2022-06-09 17:40:25] [INFO ] Deduced a trap composed of 32 places in 933 ms of which 2 ms to minimize.
[2022-06-09 17:40:25] [INFO ] Deduced a trap composed of 40 places in 783 ms of which 1 ms to minimize.
[2022-06-09 17:40:26] [INFO ] Deduced a trap composed of 60 places in 695 ms of which 2 ms to minimize.
[2022-06-09 17:40:27] [INFO ] Deduced a trap composed of 54 places in 681 ms of which 1 ms to minimize.
[2022-06-09 17:40:28] [INFO ] Deduced a trap composed of 37 places in 601 ms of which 1 ms to minimize.
[2022-06-09 17:40:28] [INFO ] Deduced a trap composed of 52 places in 677 ms of which 1 ms to minimize.
[2022-06-09 17:40:29] [INFO ] Deduced a trap composed of 49 places in 654 ms of which 1 ms to minimize.
[2022-06-09 17:40:30] [INFO ] Deduced a trap composed of 54 places in 560 ms of which 0 ms to minimize.
[2022-06-09 17:40:30] [INFO ] Deduced a trap composed of 48 places in 522 ms of which 1 ms to minimize.
[2022-06-09 17:40:31] [INFO ] Deduced a trap composed of 46 places in 676 ms of which 1 ms to minimize.
[2022-06-09 17:40:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 10179 ms
[2022-06-09 17:40:32] [INFO ] Deduced a trap composed of 49 places in 717 ms of which 2 ms to minimize.
[2022-06-09 17:40:33] [INFO ] Deduced a trap composed of 48 places in 693 ms of which 1 ms to minimize.
[2022-06-09 17:40:34] [INFO ] Deduced a trap composed of 46 places in 695 ms of which 1 ms to minimize.
[2022-06-09 17:40:35] [INFO ] Deduced a trap composed of 33 places in 710 ms of which 1 ms to minimize.
[2022-06-09 17:40:35] [INFO ] Deduced a trap composed of 53 places in 620 ms of which 1 ms to minimize.
[2022-06-09 17:40:36] [INFO ] Deduced a trap composed of 37 places in 616 ms of which 1 ms to minimize.
[2022-06-09 17:40:37] [INFO ] Deduced a trap composed of 41 places in 579 ms of which 1 ms to minimize.
[2022-06-09 17:40:37] [INFO ] Deduced a trap composed of 40 places in 544 ms of which 1 ms to minimize.
[2022-06-09 17:40:38] [INFO ] Deduced a trap composed of 35 places in 510 ms of which 1 ms to minimize.
[2022-06-09 17:40:38] [INFO ] Deduced a trap composed of 49 places in 538 ms of which 1 ms to minimize.
[2022-06-09 17:40:39] [INFO ] Deduced a trap composed of 47 places in 451 ms of which 0 ms to minimize.
[2022-06-09 17:40:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7561 ms
[2022-06-09 17:40:40] [INFO ] Deduced a trap composed of 40 places in 633 ms of which 1 ms to minimize.
[2022-06-09 17:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 766 ms
[2022-06-09 17:40:41] [INFO ] Deduced a trap composed of 47 places in 653 ms of which 1 ms to minimize.
[2022-06-09 17:40:41] [INFO ] Deduced a trap composed of 45 places in 632 ms of which 1 ms to minimize.
[2022-06-09 17:40:42] [INFO ] Deduced a trap composed of 41 places in 638 ms of which 1 ms to minimize.
[2022-06-09 17:40:43] [INFO ] Deduced a trap composed of 46 places in 715 ms of which 1 ms to minimize.
[2022-06-09 17:40:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2985 ms
[2022-06-09 17:40:43] [INFO ] After 22928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 674 ms.
[2022-06-09 17:40:44] [INFO ] After 24768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 1785 ms.
Support contains 59 out of 283 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 283/283 places, 1129/1129 transitions.
Graph (trivial) has 124 edges and 283 vertex of which 6 / 283 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 1073
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 61 rules applied. Total rules applied 112 place count 230 transition count 1062
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 221 transition count 1062
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 121 place count 221 transition count 1053
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 139 place count 212 transition count 1053
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 147 place count 204 transition count 1045
Iterating global reduction 3 with 8 rules applied. Total rules applied 155 place count 204 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 203 transition count 1044
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 203 transition count 1044
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 173 place count 195 transition count 1036
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 175 place count 195 transition count 1034
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 183 place count 187 transition count 1026
Iterating global reduction 4 with 8 rules applied. Total rules applied 191 place count 187 transition count 1026
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 184 transition count 1023
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 184 transition count 1023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 184 transition count 1022
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 211 place count 184 transition count 1009
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 227 place count 184 transition count 993
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 244 place count 168 transition count 992
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 259 place count 168 transition count 977
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 262 place count 168 transition count 977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 168 transition count 976
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 264 place count 168 transition count 976
Applied a total of 264 rules in 726 ms. Remains 168 /283 variables (removed 115) and now considering 976/1129 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 168/283 places, 976/1129 transitions.
Incomplete random walk after 1000000 steps, including 48431 resets, run finished after 28360 ms. (steps per millisecond=35 ) properties (out of 6) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4995 resets, run finished after 4294 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5013 resets, run finished after 4616 ms. (steps per millisecond=216 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4978 resets, run finished after 3722 ms. (steps per millisecond=268 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4994 resets, run finished after 3371 ms. (steps per millisecond=296 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5037 resets, run finished after 3825 ms. (steps per millisecond=261 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 976 rows 168 cols
[2022-06-09 17:41:35] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 17:41:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-09 17:41:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 17:41:35] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-09 17:41:35] [INFO ] State equation strengthened by 721 read => feed constraints.
[2022-06-09 17:41:36] [INFO ] After 670ms SMT Verify possible using 721 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-09 17:41:37] [INFO ] Deduced a trap composed of 32 places in 487 ms of which 1 ms to minimize.
[2022-06-09 17:41:37] [INFO ] Deduced a trap composed of 21 places in 468 ms of which 1 ms to minimize.
[2022-06-09 17:41:38] [INFO ] Deduced a trap composed of 27 places in 458 ms of which 1 ms to minimize.
[2022-06-09 17:41:38] [INFO ] Deduced a trap composed of 28 places in 451 ms of which 0 ms to minimize.
[2022-06-09 17:41:39] [INFO ] Deduced a trap composed of 27 places in 449 ms of which 1 ms to minimize.
[2022-06-09 17:41:39] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 1 ms to minimize.
[2022-06-09 17:41:40] [INFO ] Deduced a trap composed of 26 places in 454 ms of which 1 ms to minimize.
[2022-06-09 17:41:40] [INFO ] Deduced a trap composed of 26 places in 459 ms of which 1 ms to minimize.
[2022-06-09 17:41:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4342 ms
[2022-06-09 17:41:41] [INFO ] Deduced a trap composed of 14 places in 449 ms of which 1 ms to minimize.
[2022-06-09 17:41:42] [INFO ] Deduced a trap composed of 35 places in 395 ms of which 1 ms to minimize.
[2022-06-09 17:41:42] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 1 ms to minimize.
[2022-06-09 17:41:42] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 2 ms to minimize.
[2022-06-09 17:41:43] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 1 ms to minimize.
[2022-06-09 17:41:43] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2022-06-09 17:41:44] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 1 ms to minimize.
[2022-06-09 17:41:44] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 0 ms to minimize.
[2022-06-09 17:41:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3358 ms
[2022-06-09 17:41:45] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 1 ms to minimize.
[2022-06-09 17:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2022-06-09 17:41:45] [INFO ] After 9310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 605 ms.
[2022-06-09 17:41:45] [INFO ] After 10551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 1362 ms.
Support contains 44 out of 168 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 168/168 places, 976/976 transitions.
Graph (trivial) has 34 edges and 168 vertex of which 2 / 168 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 962
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 155 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 154 transition count 961
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 154 transition count 960
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 153 transition count 960
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 152 transition count 959
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 152 transition count 959
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 151 transition count 957
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 151 transition count 957
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 147 transition count 953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 147 transition count 952
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 146 transition count 951
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 146 transition count 951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 146 transition count 950
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 49 place count 146 transition count 946
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 55 place count 146 transition count 940
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 61 place count 140 transition count 940
Applied a total of 61 rules in 366 ms. Remains 140 /168 variables (removed 28) and now considering 940/976 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/168 places, 940/976 transitions.
Incomplete random walk after 1000000 steps, including 46287 resets, run finished after 15768 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5097 resets, run finished after 2885 ms. (steps per millisecond=346 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5121 resets, run finished after 3298 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19381901 steps, run timeout after 63001 ms. (steps per millisecond=307 ) properties seen :{1=1}
Probabilistic random walk after 19381901 steps, saw 2922331 distinct states, run finished after 63002 ms. (steps per millisecond=307 ) properties seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 940 rows 140 cols
[2022-06-09 17:43:12] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 17:43:12] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 17:43:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 17:43:12] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 17:43:12] [INFO ] State equation strengthened by 720 read => feed constraints.
[2022-06-09 17:43:13] [INFO ] After 424ms SMT Verify possible using 720 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 17:43:13] [INFO ] Deduced a trap composed of 14 places in 574 ms of which 1 ms to minimize.
[2022-06-09 17:43:14] [INFO ] Deduced a trap composed of 21 places in 556 ms of which 2 ms to minimize.
[2022-06-09 17:43:15] [INFO ] Deduced a trap composed of 20 places in 565 ms of which 1 ms to minimize.
[2022-06-09 17:43:15] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2022-06-09 17:43:16] [INFO ] Deduced a trap composed of 25 places in 495 ms of which 1 ms to minimize.
[2022-06-09 17:43:17] [INFO ] Deduced a trap composed of 20 places in 539 ms of which 1 ms to minimize.
[2022-06-09 17:43:17] [INFO ] Deduced a trap composed of 15 places in 569 ms of which 1 ms to minimize.
[2022-06-09 17:43:18] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 1 ms to minimize.
[2022-06-09 17:43:18] [INFO ] Deduced a trap composed of 24 places in 472 ms of which 1 ms to minimize.
[2022-06-09 17:43:19] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 0 ms to minimize.
[2022-06-09 17:43:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5866 ms
[2022-06-09 17:43:19] [INFO ] After 6357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-09 17:43:19] [INFO ] After 6791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 140/140 places, 940/940 transitions.
Graph (trivial) has 61 edges and 140 vertex of which 2 / 140 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 139 transition count 917
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 118 transition count 917
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 43 place count 118 transition count 914
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 115 transition count 914
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 111 transition count 910
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 111 transition count 910
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 110 transition count 909
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 110 transition count 909
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 109 transition count 908
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 109 transition count 908
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 109 transition count 899
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 84 place count 102 transition count 892
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 91 place count 102 transition count 885
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 97 place count 96 transition count 879
Iterating global reduction 4 with 6 rules applied. Total rules applied 103 place count 96 transition count 879
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 94 transition count 877
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 94 transition count 877
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 112 place count 94 transition count 872
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 93 transition count 885
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 122 place count 93 transition count 877
Free-agglomeration rule applied 10 times with reduction of 173 identical transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 132 place count 93 transition count 694
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 83 rules applied. Total rules applied 215 place count 83 transition count 621
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 271 place count 83 transition count 565
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 83 transition count 565
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 83 transition count 564
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 83 transition count 564
Applied a total of 274 rules in 800 ms. Remains 83 /140 variables (removed 57) and now considering 564/940 (removed 376) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/140 places, 564/940 transitions.
Incomplete random walk after 1000000 steps, including 887 resets, run finished after 7004 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 348 resets, run finished after 2017 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 11494850 steps, run timeout after 27001 ms. (steps per millisecond=425 ) properties seen :{}
Probabilistic random walk after 11494850 steps, saw 2078550 distinct states, run finished after 27002 ms. (steps per millisecond=425 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:43:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-09 17:43:56] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 17:43:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 17:43:56] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 17:43:56] [INFO ] State equation strengthened by 445 read => feed constraints.
[2022-06-09 17:43:56] [INFO ] After 115ms SMT Verify possible using 445 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 17:43:56] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2022-06-09 17:43:56] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2022-06-09 17:43:57] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2022-06-09 17:43:57] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2022-06-09 17:43:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 905 ms
[2022-06-09 17:43:57] [INFO ] After 1050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-09 17:43:57] [INFO ] After 1300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 70 ms.
Support contains 16 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 70 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 564/564 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 65 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:43:57] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:43:57] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:43:57] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:43:58] [INFO ] State equation strengthened by 445 read => feed constraints.
[2022-06-09 17:43:59] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2022-06-09 17:43:59] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:43:59] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:43:59] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 564/564 transitions.
Incomplete random walk after 1000000 steps, including 714 resets, run finished after 7781 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 172 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 11435783 steps, run timeout after 27001 ms. (steps per millisecond=423 ) properties seen :{}
Probabilistic random walk after 11435783 steps, saw 2069063 distinct states, run finished after 27001 ms. (steps per millisecond=423 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:44:36] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-09 17:44:36] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 17:44:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 17:44:36] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 17:44:36] [INFO ] State equation strengthened by 445 read => feed constraints.
[2022-06-09 17:44:36] [INFO ] After 98ms SMT Verify possible using 445 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 17:44:36] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2022-06-09 17:44:36] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2022-06-09 17:44:37] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 3 ms to minimize.
[2022-06-09 17:44:37] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2022-06-09 17:44:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 783 ms
[2022-06-09 17:44:37] [INFO ] After 912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-09 17:44:37] [INFO ] After 1179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 16 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 64 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 564/564 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 64 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:44:37] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:44:37] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:44:37] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 17:44:38] [INFO ] State equation strengthened by 445 read => feed constraints.
[2022-06-09 17:44:39] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2022-06-09 17:44:39] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 564 rows 83 cols
[2022-06-09 17:44:39] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:44:40] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 564/564 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 83 transition count 552
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 71 transition count 550
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 69 transition count 550
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 69 transition count 549
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 68 transition count 549
Performed 14 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 58 place count 54 transition count 519
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 70 place count 54 transition count 507
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 78 place count 50 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 49 transition count 503
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 49 transition count 498
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 49 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 48 transition count 497
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 96 place count 48 transition count 497
Applied a total of 96 rules in 73 ms. Remains 48 /83 variables (removed 35) and now considering 497/564 (removed 67) transitions.
Running SMT prover for 1 properties.
[2022-06-09 17:44:40] [INFO ] Flow matrix only has 490 transitions (discarded 7 similar events)
// Phase 1: matrix 490 rows 48 cols
[2022-06-09 17:44:40] [INFO ] Computed 8 place invariants in 3 ms
[2022-06-09 17:44:40] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 17:44:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 17:44:40] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 17:44:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-09 17:44:40] [INFO ] After 40ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 17:44:40] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2022-06-09 17:44:41] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-06-09 17:44:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2022-06-09 17:44:41] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-09 17:44:41] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-09 17:44:41] [INFO ] Flatten gal took : 216 ms
[2022-06-09 17:44:41] [INFO ] Flatten gal took : 143 ms
[2022-06-09 17:44:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11491908932751678714.gal : 34 ms
[2022-06-09 17:44:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9763596447082140411.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/ReachabilityCardinality11491908932751678714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9763596447082140411.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/ReachabilityCardinality9763596447082140411.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 124
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :124 after 979
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :979 after 6430
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6430 after 8943
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :234633 after 241059
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,385923,1.3111,12044,2,585,13,24539,7,0,723,14987,0
Total reachable state count : 385923

Verifying 1 reachability properties.
Invariant property StigmergyCommit-PT-07b-ReachabilityCardinality-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-07b-ReachabilityCardinality-02,1,1.31552,12300,2,49,13,24539,7,0,734,14987,0
[2022-06-09 17:44:43] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1416029374228465039
[2022-06-09 17:44:43] [INFO ] Applying decomposition
[2022-06-09 17:44:43] [INFO ] Computing symmetric may disable matrix : 564 transitions.
[2022-06-09 17:44:43] [INFO ] Flatten gal took : 166 ms
[2022-06-09 17:44:43] [INFO ] Flatten gal took : 122 ms
[2022-06-09 17:44:43] [INFO ] Computation of Complete disable matrix. took 143 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 17:44:43] [INFO ] Computing symmetric may enable matrix : 564 transitions.
[2022-06-09 17:44:43] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 17:44:43] [INFO ] Input system was already deterministic with 564 transitions.
[2022-06-09 17:44:43] [INFO ] Computing Do-Not-Accords matrix : 564 transitions.
[2022-06-09 17:44:43] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph6135719353050725259.txt' '-o' '/tmp/graph6135719353050725259.bin' '-w' '/tmp/graph6135719353050725259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6135719353050725259.bin' '-l' '-1' '-v' '-w' '/tmp/graph6135719353050725259.weights' '-q' '0' '-e' '0.001'
[2022-06-09 17:44:44] [INFO ] Built C files in 724ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1416029374228465039
[2022-06-09 17:44:44] [INFO ] Decomposing Gal with order
Running compilation step : cd /tmp/ltsmin1416029374228465039;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-06-09 17:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:44:44] [INFO ] Ran tautology test, simplified 0 / 1 in 1197 ms.
[2022-06-09 17:44:44] [INFO ] BMC solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(UNSAT) depth K=0 took 14 ms
[2022-06-09 17:44:44] [INFO ] Removed a total of 3525 redundant transitions.
[2022-06-09 17:44:44] [INFO ] BMC solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(UNSAT) depth K=1 took 39 ms
[2022-06-09 17:44:44] [INFO ] Flatten gal took : 516 ms
[2022-06-09 17:44:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 123 ms.
[2022-06-09 17:44:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7161432126165744164.gal : 50 ms
[2022-06-09 17:44:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16724085835088626105.prop : 2 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/ReachabilityCardinality7161432126165744164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16724085835088626105.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16724085835088626105.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 564 rows 83 cols
SDD proceeding with computation,1 properties remain. new max is 4
[2022-06-09 17:44:45] [INFO ] Computed 8 place invariants in 2 ms
SDD size :1 after 215
[2022-06-09 17:44:45] [INFO ] Computed 8 place invariants in 11 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :215 after 2305
[2022-06-09 17:44:46] [INFO ] BMC solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(UNSAT) depth K=2 took 2077 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2305 after 3452
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3452 after 6904
[2022-06-09 17:44:48] [INFO ] Proved 83 variables to be positive in 3172 ms
[2022-06-09 17:44:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:44:48] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=0 took 19 ms
Compilation finished in 4581 ms.
Running link step : cd /tmp/ltsmin1416029374228465039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin1416029374228465039;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'StigmergyCommitPT07bReachabilityCardinality02==true'
[2022-06-09 17:44:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:44:48] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=1 took 292 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6904 after 74388
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :74388 after 93156
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :93156 after 106092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :106092 after 171180
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :171180 after 319616
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :319616 after 1.38646e+06
[2022-06-09 17:45:15] [INFO ] BMC solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(UNSAT) depth K=3 took 28313 ms
[2022-06-09 17:45:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:45:16] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=2 took 27432 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.38646e+06 after 2.06783e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.06783e+06 after 2.06783e+06
[2022-06-09 17:45:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:45:40] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=3 took 24127 ms
[2022-06-09 17:46:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:46:09] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=4 took 28780 ms
[2022-06-09 17:47:38] [INFO ] BMC solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(UNSAT) depth K=4 took 143165 ms
[2022-06-09 17:48:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesStigmergyCommit-PT-07b-ReachabilityCardinality-02
[2022-06-09 17:48:00] [INFO ] KInduction solution for property StigmergyCommit-PT-07b-ReachabilityCardinality-02(SAT) depth K=5 took 111164 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.0722e+06,89.5109,1581280,6681,1888,432567,143861,925,1.88137e+07,169,1.49884e+06,0
Total reachable state count : 8072205

Verifying 1 reachability properties.
Invariant property StigmergyCommit-PT-07b-ReachabilityCardinality-02 is true.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-07b-ReachabilityCardinality-02,0,92.4952,1581280,1,0,432567,143861,966,1.88137e+07,179,1.49884e+06,27358
ITS tools runner thread asked to quit. Dying gracefully.
[2022-06-09 17:48:53] [WARNING] Interrupting SMT solver.
[2022-06-09 17:48:53] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 17:48:53] [WARNING] Unexpected error occurred while running SMT. Was verifying StigmergyCommit-PT-07b-ReachabilityCardinality-02 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-09 17:48:53] [INFO ] During BMC, SMT solver timed out at depth 5
[2022-06-09 17:48:53] [WARNING] Unexpected error occurred while running SMT. Was verifying StigmergyCommit-PT-07b-ReachabilityCardinality-02 K-induction depth 6
Exception in thread "Thread-7" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-09 17:48:53] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2022-06-09 17:48:53] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 632352 ms.

BK_STOP 1654796933273

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityCardinality -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 3600 -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="StigmergyCommit-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-07b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872500182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07b.tgz
mv StigmergyCommit-PT-07b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;