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.r179-tall-165277026600006.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 Peterson-COL-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026600006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.9K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 30 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 30 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:34 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 Peterson-COL-3-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068447511

Running Version 0
[2022-06-12 21:14:09] [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-12 21:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-12 21:14:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:14:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 645 ms
[2022-06-12 21:14:10] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-12 21:14:10] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-06-12 21:14:10] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_8671091245672233885.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2022-06-12 21:14:10] [INFO ] Flatten gal took : 30 ms
[2022-06-12 21:14:10] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:10] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 19 ms.
[2022-06-12 21:14:10] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_12990282892971765233.dot
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :4
FORMULA Peterson-COL-3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 9) seen :1
FORMULA Peterson-COL-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-12 21:14:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-06-12 21:14:11] [INFO ] Computed 15 place invariants in 21 ms
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-12 21:14:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:14:11] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:14:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:12] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-12 21:14:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 5 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1636 ms
[2022-06-12 21:14:13] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 37 ms.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:14:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 422 ms
[2022-06-12 21:14:14] [INFO ] Added : 114 causal constraints over 23 iterations in 1087 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:14:14] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:14] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-06-12 21:14:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:14] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:15] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-12 21:14:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 81 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 73 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:14:15] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 3 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 83 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 4 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 8 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 57 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Deduced a trap composed of 66 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 59 trap constraints in 3817 ms
[2022-06-12 21:14:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-12 21:14:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:19] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:14:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:19] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-06-12 21:14:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 10 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1246 ms
[2022-06-12 21:14:20] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 20 ms.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-06-12 21:14:22] [INFO ] Added : 278 causal constraints over 56 iterations in 1643 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:14:22] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned unsat
[2022-06-12 21:14:22] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2022-06-12 21:14:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:22] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-12 21:14:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2022-06-12 21:14:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:22] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-12 21:14:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:14:22] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:14:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:14:24] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:14:24] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:14:24] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:14:24] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1512 ms
[2022-06-12 21:14:24] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2022-06-12 21:14:25] [INFO ] Added : 281 causal constraints over 57 iterations in 1510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2022-06-12 21:14:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:26] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-06-12 21:14:26] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Deduced a trap composed of 52 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:14:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 581 ms
[2022-06-12 21:14:26] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 18 ms.
[2022-06-12 21:14:28] [INFO ] Added : 283 causal constraints over 57 iterations in 1399 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:14:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 327 ms
[2022-06-12 21:14:28] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 19 ms.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 467 ms
[2022-06-12 21:14:30] [INFO ] Added : 181 causal constraints over 37 iterations in 1327 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2022-06-12 21:14:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-06-12 21:14:30] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1170 ms
[2022-06-12 21:14:31] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2022-06-12 21:14:33] [INFO ] Added : 278 causal constraints over 56 iterations in 1496 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
FORMULA Peterson-COL-3-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 20900 steps, including 686 resets, run finished after 89 ms. (steps per millisecond=234 ) properties (out of 6) seen :4 could not realise parikh vector
FORMULA Peterson-COL-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 74100 steps, including 708 resets, run finished after 225 ms. (steps per millisecond=329 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 70700 steps, including 778 resets, run finished after 201 ms. (steps per millisecond=351 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 83400 steps, including 818 resets, run finished after 235 ms. (steps per millisecond=354 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26400 steps, including 849 resets, run finished after 70 ms. (steps per millisecond=377 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 89300 steps, including 921 resets, run finished after 244 ms. (steps per millisecond=365 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 160 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 244 transition count 305
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 217 transition count 305
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 54 place count 217 transition count 296
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 72 place count 208 transition count 296
Applied a total of 72 rules in 33 ms. Remains 208 /244 variables (removed 36) and now considering 296/332 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/244 places, 296/332 transitions.
[2022-06-12 21:14:34] [INFO ] Flatten gal took : 28 ms
[2022-06-12 21:14:34] [INFO ] Flatten gal took : 20 ms
[2022-06-12 21:14:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5877704733376132368.gal : 7 ms
[2022-06-12 21:14:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5555894186392346996.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/ReachabilityCardinality5877704733376132368.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5555894186392346996.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/ReachabilityCardinality5877704733376132368.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5555894186392346996.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5555894186392346996.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 64
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :64 after 260
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :260 after 643
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :643 after 5112
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5112 after 14562
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14562 after 33491
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :33491 after 48223
Reachability property Peterson-COL-3-ReachabilityFireability-08 is true.
FORMULA Peterson-COL-3-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :48223 after 103017
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :103017 after 160571
Invariant property Peterson-COL-3-ReachabilityFireability-14 does not hold.
FORMULA Peterson-COL-3-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
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,399390,8.28727,157372,2,48337,21,543009,6,0,1131,606547,0
Total reachable state count : 399390

Verifying 2 reachability properties.
Reachability property Peterson-COL-3-ReachabilityFireability-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-COL-3-ReachabilityFireability-08,671,8.41629,157372,2,3955,21,543009,7,0,1223,606547,0
Invariant property Peterson-COL-3-ReachabilityFireability-14 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
Peterson-COL-3-ReachabilityFireability-14,12,9.77028,157372,2,1299,21,543009,8,0,1521,606547,0
All properties solved without resorting to model-checking.

BK_STOP 1655068485103

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r179-tall-165277026600006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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