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.r305-smll-165463878400057.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 gold2021
Input is StigmergyCommit-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K May 30 14:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 6.8K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 14:56 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 1.4M 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-05b-ReachabilityFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654719660975

Running Version 0
[2022-06-08 20:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-08 20:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:21:04] [INFO ] Load time of PNML (sax parser for PT used): 446 ms
[2022-06-08 20:21:04] [INFO ] Transformed 1837 places.
[2022-06-08 20:21:04] [INFO ] Transformed 3460 transitions.
[2022-06-08 20:21:04] [INFO ] Found NUPN structural information;
[2022-06-08 20:21:04] [INFO ] Parsed PT model containing 1837 places and 3460 transitions in 560 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 89 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 3460 rows 1837 cols
[2022-06-08 20:21:05] [INFO ] Computed 7 place invariants in 115 ms
[2022-06-08 20:21:06] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2022-06-08 20:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:08] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2022-06-08 20:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 48 ms returned unsat
[2022-06-08 20:21:10] [INFO ] [Real]Absence check using 7 positive place invariants in 47 ms returned unsat
[2022-06-08 20:21:10] [INFO ] [Real]Absence check using 7 positive place invariants in 49 ms returned sat
[2022-06-08 20:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:12] [INFO ] [Real]Absence check using state equation in 1576 ms returned sat
[2022-06-08 20:21:14] [INFO ] Deduced a trap composed of 400 places in 2183 ms of which 6 ms to minimize.
[2022-06-08 20:21:16] [INFO ] Deduced a trap composed of 298 places in 1907 ms of which 4 ms to minimize.
[2022-06-08 20:21:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-08 20:21:17] [INFO ] [Real]Absence check using 7 positive place invariants in 47 ms returned sat
[2022-06-08 20:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:19] [INFO ] [Real]Absence check using state equation in 1754 ms returned sat
[2022-06-08 20:21:21] [INFO ] Deduced a trap composed of 397 places in 2686 ms of which 6 ms to minimize.
[2022-06-08 20:21:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-08 20:21:22] [INFO ] [Real]Absence check using 7 positive place invariants in 63 ms returned sat
[2022-06-08 20:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:24] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2022-06-08 20:21:26] [INFO ] Deduced a trap composed of 399 places in 1911 ms of which 2 ms to minimize.
[2022-06-08 20:21:28] [INFO ] Deduced a trap composed of 494 places in 1980 ms of which 2 ms to minimize.
[2022-06-08 20:21:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-08 20:21:29] [INFO ] [Real]Absence check using 7 positive place invariants in 73 ms returned sat
[2022-06-08 20:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:31] [INFO ] [Real]Absence check using state equation in 1705 ms returned sat
[2022-06-08 20:21:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 77 ms returned sat
[2022-06-08 20:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:33] [INFO ] [Nat]Absence check using state equation in 1943 ms returned sat
[2022-06-08 20:21:36] [INFO ] Deduced a trap composed of 399 places in 2992 ms of which 3 ms to minimize.
[2022-06-08 20:21:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-08 20:21:37] [INFO ] [Real]Absence check using 7 positive place invariants in 62 ms returned sat
[2022-06-08 20:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:39] [INFO ] [Real]Absence check using state equation in 2416 ms returned sat
[2022-06-08 20:21:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 50 ms returned sat
[2022-06-08 20:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:42] [INFO ] [Nat]Absence check using state equation in 2408 ms returned sat
[2022-06-08 20:21:43] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 388 ms.
[2022-06-08 20:21:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-08 20:21:45] [INFO ] [Real]Absence check using 7 positive place invariants in 81 ms returned sat
[2022-06-08 20:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:50] [INFO ] [Real]Absence check using state equation in 4358 ms returned unknown
[2022-06-08 20:21:50] [INFO ] [Real]Absence check using 7 positive place invariants in 66 ms returned sat
[2022-06-08 20:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:53] [INFO ] [Real]Absence check using state equation in 2235 ms returned sat
[2022-06-08 20:21:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:21:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 80 ms returned sat
[2022-06-08 20:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:21:56] [INFO ] [Nat]Absence check using state equation in 2303 ms returned sat
[2022-06-08 20:21:59] [INFO ] Deduced a trap composed of 396 places in 3010 ms of which 3 ms to minimize.
[2022-06-08 20:21:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2022-06-08 20:21:59] [INFO ] [Real]Absence check using 7 positive place invariants in 67 ms returned sat
[2022-06-08 20:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:02] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2022-06-08 20:22:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 81 ms returned sat
[2022-06-08 20:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:05] [INFO ] [Nat]Absence check using state equation in 2226 ms returned sat
[2022-06-08 20:22:08] [INFO ] Deduced a trap composed of 491 places in 2891 ms of which 3 ms to minimize.
[2022-06-08 20:22:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2022-06-08 20:22:08] [INFO ] [Real]Absence check using 7 positive place invariants in 59 ms returned sat
[2022-06-08 20:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:10] [INFO ] [Real]Absence check using state equation in 1747 ms returned sat
[2022-06-08 20:22:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 52 ms returned unsat
[2022-06-08 20:22:11] [INFO ] [Real]Absence check using 7 positive place invariants in 48 ms returned sat
[2022-06-08 20:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:13] [INFO ] [Real]Absence check using state equation in 2052 ms returned sat
[2022-06-08 20:22:14] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 794 ms.
[2022-06-08 20:22:15] [INFO ] Added : 20 causal constraints over 4 iterations in 2304 ms. Result :unknown
[2022-06-08 20:22:16] [INFO ] [Real]Absence check using 7 positive place invariants in 70 ms returned unsat
[2022-06-08 20:22:17] [INFO ] [Real]Absence check using 7 positive place invariants in 46 ms returned sat
[2022-06-08 20:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:18] [INFO ] [Real]Absence check using state equation in 1779 ms returned sat
[2022-06-08 20:22:19] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 266 ms.
[2022-06-08 20:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 82 ms returned sat
[2022-06-08 20:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:23] [INFO ] [Nat]Absence check using state equation in 1908 ms returned sat
[2022-06-08 20:22:24] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 263 ms.
[2022-06-08 20:22:29] [INFO ] Deduced a trap composed of 396 places in 2960 ms of which 2 ms to minimize.
[2022-06-08 20:22:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 34100 steps, including 392 resets, run finished after 210 ms. (steps per millisecond=162 ) properties (out of 10) seen :0 could not realise parikh vector
Support contains 90 out of 1837 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1643 edges and 1837 vertex of which 115 / 1837 are part of one of the 17 SCC in 15 ms
Free SCC test removed 98 places
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 2734 edges and 1739 vertex of which 1728 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.41 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1208 transitions
Trivial Post-agglo rules discarded 1208 transitions
Performed 1208 trivial Post agglomeration. Transition count delta: 1208
Iterating post reduction 0 with 1213 rules applied. Total rules applied 1215 place count 1728 transition count 2117
Reduce places removed 1208 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1231 rules applied. Total rules applied 2446 place count 520 transition count 2094
Reduce places removed 10 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 2 with 74 rules applied. Total rules applied 2520 place count 510 transition count 2030
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 69 rules applied. Total rules applied 2589 place count 446 transition count 2025
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2590 place count 445 transition count 2025
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 75 Pre rules applied. Total rules applied 2590 place count 445 transition count 1950
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 2740 place count 370 transition count 1950
Discarding 67 places :
Symmetric choice reduction at 5 with 67 rule applications. Total rules 2807 place count 303 transition count 1883
Iterating global reduction 5 with 67 rules applied. Total rules applied 2874 place count 303 transition count 1883
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2878 place count 303 transition count 1879
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2896 place count 285 transition count 1850
Iterating global reduction 6 with 18 rules applied. Total rules applied 2914 place count 285 transition count 1850
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2917 place count 285 transition count 1847
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2924 place count 278 transition count 1840
Iterating global reduction 7 with 7 rules applied. Total rules applied 2931 place count 278 transition count 1840
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2935 place count 274 transition count 1836
Iterating global reduction 7 with 4 rules applied. Total rules applied 2939 place count 274 transition count 1836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2942 place count 274 transition count 1833
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 2978 place count 256 transition count 1815
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2982 place count 252 transition count 1811
Iterating global reduction 8 with 4 rules applied. Total rules applied 2986 place count 252 transition count 1811
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2990 place count 248 transition count 1807
Iterating global reduction 8 with 4 rules applied. Total rules applied 2994 place count 248 transition count 1807
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2997 place count 245 transition count 1804
Iterating global reduction 8 with 3 rules applied. Total rules applied 3000 place count 245 transition count 1804
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3006 place count 242 transition count 1809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3007 place count 242 transition count 1808
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 3009 place count 242 transition count 1806
Free-agglomeration rule applied 50 times.
Iterating global reduction 9 with 50 rules applied. Total rules applied 3059 place count 242 transition count 1756
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 9 with 50 rules applied. Total rules applied 3109 place count 192 transition count 1756
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 10 with 59 rules applied. Total rules applied 3168 place count 192 transition count 1697
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3169 place count 192 transition count 1696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3170 place count 191 transition count 1696
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 3174 place count 191 transition count 1696
Applied a total of 3174 rules in 1223 ms. Remains 191 /1837 variables (removed 1646) and now considering 1696/3460 (removed 1764) transitions.
Finished structural reductions, in 1 iterations. Remains : 191/1837 places, 1696/3460 transitions.
[2022-06-08 20:22:31] [INFO ] Flatten gal took : 585 ms
[2022-06-08 20:22:32] [INFO ] Flatten gal took : 294 ms
[2022-06-08 20:22:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11260815537487759484.gal : 113 ms
[2022-06-08 20:22:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3063021193489223393.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11260815537487759484.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3063021193489223393.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11260815537487759484.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3063021193489223393.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3063021193489223393.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :18 after 21
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :21 after 22
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :22 after 103
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :103 after 144
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :144 after 958
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :958 after 7484
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :7484 after 40352
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :40352 after 59841
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-10 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :59841 after 1.28238e+06
Detected timeout of ITS tools.
[2022-06-08 20:22:47] [INFO ] Flatten gal took : 222 ms
[2022-06-08 20:22:47] [INFO ] Applying decomposition
[2022-06-08 20:22:47] [INFO ] Flatten gal took : 193 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16642228995463844135.txt, -o, /tmp/graph16642228995463844135.bin, -w, /tmp/graph16642228995463844135.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16642228995463844135.bin, -l, -1, -v, -w, /tmp/graph16642228995463844135.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 20:22:48] [INFO ] Decomposing Gal with order
[2022-06-08 20:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:22:49] [INFO ] Removed a total of 8903 redundant transitions.
[2022-06-08 20:22:49] [INFO ] Flatten gal took : 695 ms
[2022-06-08 20:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 100 ms.
[2022-06-08 20:22:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11082278646695717518.gal : 11 ms
[2022-06-08 20:22:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3383527650006212190.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11082278646695717518.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3383527650006212190.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11082278646695717518.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3383527650006212190.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3383527650006212190.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1 after 65
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :65 after 1142
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :1142 after 1730
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1730 after 6745
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :6745 after 9304
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :9304 after 18792
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :18792 after 23450
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :23450 after 23626
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :23626 after 99226
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-15 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-13 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-09 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-07 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property StigmergyCommit-PT-05b-ReachabilityFireability-06 does not hold.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :99226 after 4.75821e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7031602866035250545
[2022-06-08 20:23:05] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7031602866035250545
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7031602866035250545]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7031602866035250545] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7031602866035250545] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 51937 resets, run finished after 3611 ms. (steps per millisecond=276 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7531 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7260 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8453 resets, run finished after 4165 ms. (steps per millisecond=240 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1696 rows 191 cols
[2022-06-08 20:23:15] [INFO ] Computed 6 place invariants in 17 ms
[2022-06-08 20:23:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-08 20:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:15] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-06-08 20:23:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-08 20:23:15] [INFO ] [Real]Added 6 Read/Feed constraints in 193 ms returned sat
[2022-06-08 20:23:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:23:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-08 20:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:16] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2022-06-08 20:23:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 325 ms returned sat
[2022-06-08 20:23:17] [INFO ] Deduced a trap composed of 35 places in 878 ms of which 2 ms to minimize.
[2022-06-08 20:23:18] [INFO ] Deduced a trap composed of 37 places in 819 ms of which 1 ms to minimize.
[2022-06-08 20:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2163 ms
[2022-06-08 20:23:19] [INFO ] Computed and/alt/rep : 1623/9135/1623 causal constraints (skipped 61 transitions) in 272 ms.
[2022-06-08 20:23:39] [INFO ] Added : 370 causal constraints over 74 iterations in 20594 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 241 ms.
[2022-06-08 20:23:40] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-08 20:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:40] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-06-08 20:23:40] [INFO ] [Real]Added 6 Read/Feed constraints in 199 ms returned sat
[2022-06-08 20:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:23:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-08 20:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:41] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2022-06-08 20:23:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 313 ms returned sat
[2022-06-08 20:23:42] [INFO ] Deduced a trap composed of 60 places in 1015 ms of which 1 ms to minimize.
[2022-06-08 20:23:44] [INFO ] Deduced a trap composed of 47 places in 904 ms of which 1 ms to minimize.
[2022-06-08 20:23:45] [INFO ] Deduced a trap composed of 39 places in 796 ms of which 1 ms to minimize.
[2022-06-08 20:23:46] [INFO ] Deduced a trap composed of 33 places in 834 ms of which 0 ms to minimize.
[2022-06-08 20:23:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4526 ms
[2022-06-08 20:23:46] [INFO ] Computed and/alt/rep : 1623/9135/1623 causal constraints (skipped 61 transitions) in 173 ms.
[2022-06-08 20:24:06] [INFO ] Added : 280 causal constraints over 56 iterations in 20413 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-06-08 20:24:07] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2022-06-08 20:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:24:07] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2022-06-08 20:24:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:24:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned unsat
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 2337700 steps, including 100534 resets, run finished after 8907 ms. (steps per millisecond=262 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2342200 steps, including 125356 resets, run finished after 10117 ms. (steps per millisecond=231 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 191/191 places, 1696/1696 transitions.
Graph (trivial) has 148 edges and 191 vertex of which 5 / 191 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 796 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 187 transition count 1640
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 138 transition count 1634
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 136 transition count 1634
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 109 place count 136 transition count 1629
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 119 place count 131 transition count 1629
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 143 place count 107 transition count 318
Iterating global reduction 3 with 24 rules applied. Total rules applied 167 place count 107 transition count 318
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 177 place count 107 transition count 308
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 183 place count 101 transition count 302
Iterating global reduction 4 with 6 rules applied. Total rules applied 189 place count 101 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 101 transition count 301
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 192 place count 99 transition count 299
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 99 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 195 place count 99 transition count 298
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 98 transition count 297
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 98 transition count 297
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 219 place count 87 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 87 transition count 282
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 234 place count 76 transition count 240
Iterating global reduction 7 with 11 rules applied. Total rules applied 245 place count 76 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 247 place count 76 transition count 238
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 252 place count 71 transition count 233
Iterating global reduction 8 with 5 rules applied. Total rules applied 257 place count 71 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 263 place count 71 transition count 227
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 264 place count 70 transition count 226
Iterating global reduction 9 with 1 rules applied. Total rules applied 265 place count 70 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 266 place count 70 transition count 225
Performed 2 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 270 place count 68 transition count 237
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 278 place count 68 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 280 place count 67 transition count 244
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 284 place count 67 transition count 240
Free-agglomeration rule applied 26 times.
Iterating global reduction 11 with 26 rules applied. Total rules applied 310 place count 67 transition count 214
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 11 with 68 rules applied. Total rules applied 378 place count 41 transition count 172
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 384 place count 35 transition count 166
Iterating global reduction 12 with 6 rules applied. Total rules applied 390 place count 35 transition count 166
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 12 with 31 rules applied. Total rules applied 421 place count 35 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 423 place count 35 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 424 place count 35 transition count 134
Applied a total of 424 rules in 200 ms. Remains 35 /191 variables (removed 156) and now considering 134/1696 (removed 1562) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/191 places, 134/1696 transitions.
[2022-06-08 20:24:27] [INFO ] Flatten gal took : 9 ms
[2022-06-08 20:24:27] [INFO ] Flatten gal took : 8 ms
[2022-06-08 20:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4452738427253180770.gal : 3 ms
[2022-06-08 20:24:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10008350676566807054.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4452738427253180770.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10008350676566807054.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4452738427253180770.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10008350676566807054.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10008350676566807054.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 143
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :143 after 200
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :200 after 471
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,13485,0.26973,8648,2,617,10,12189,8,0,278,7181,0
Total reachable state count : 13485

Verifying 2 reachability properties.
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-03 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-05b-ReachabilityFireability-03,960,0.271522,8648,2,180,10,12189,8,0,280,7181,0
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-05 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-05b-ReachabilityFireability-05,1,0.272329,8912,2,36,10,12189,8,0,282,7181,0
All properties solved without resorting to model-checking.

BK_STOP 1654719868483

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is StigmergyCommit-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878400057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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