Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171000039.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CANConstruction-PT-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171000039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 28K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.3K May 11 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 11 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 37M May 12 08:13 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 gen-ReachabilityCardinality-00
FORMULA_NAME gen-ReachabilityCardinality-01
FORMULA_NAME gen-ReachabilityCardinality-02
FORMULA_NAME gen-ReachabilityCardinality-03
FORMULA_NAME gen-ReachabilityCardinality-04
FORMULA_NAME gen-ReachabilityCardinality-05
FORMULA_NAME gen-ReachabilityCardinality-06
FORMULA_NAME gen-ReachabilityCardinality-07
FORMULA_NAME gen-ReachabilityCardinality-08
FORMULA_NAME gen-ReachabilityCardinality-09
FORMULA_NAME gen-ReachabilityCardinality-10
FORMULA_NAME gen-ReachabilityCardinality-11
FORMULA_NAME gen-ReachabilityCardinality-12
FORMULA_NAME gen-ReachabilityCardinality-13
FORMULA_NAME gen-ReachabilityCardinality-14
FORMULA_NAME gen-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621331681654

[2021-05-18 09:54:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 09:54:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:54:50] [INFO ] Load time of PNML (sax parser for PT used): 958 ms
[2021-05-18 09:54:50] [INFO ] Transformed 17282 places.
[2021-05-18 09:54:50] [INFO ] Transformed 33120 transitions.
[2021-05-18 09:54:50] [INFO ] Parsed PT model containing 17282 places and 33120 transitions in 1172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 191 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 352 ms. (steps per millisecond=28 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA gen-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 33120 rows 17282 cols
[2021-05-18 09:54:53] [INFO ] Computed 181 place invariants in 2063 ms
[2021-05-18 09:54:57] [INFO ] [Real]Absence check using 91 positive place invariants in 1861 ms returned sat
[2021-05-18 09:54:58] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 922 ms returned sat
[2021-05-18 09:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:54: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: Broken pipe (>= t3477 0)") while checking expression at index 0
[2021-05-18 09:55:02] [INFO ] [Real]Absence check using 91 positive place invariants in 1889 ms returned sat
[2021-05-18 09:55:03] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 1053 ms returned sat
[2021-05-18 09:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:04] [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: Broken pipe (>= t4175 0)") while checking expression at index 1
[2021-05-18 09:55:07] [INFO ] [Real]Absence check using 91 positive place invariants in 1275 ms returned unsat
[2021-05-18 09:55:10] [INFO ] [Real]Absence check using 91 positive place invariants in 1770 ms returned sat
[2021-05-18 09:55:10] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 890 ms returned sat
[2021-05-18 09:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:12] [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: Broken pipe (>= t11965 0)") while checking expression at index 3
[2021-05-18 09:55:15] [INFO ] [Real]Absence check using 91 positive place invariants in 1830 ms returned sat
[2021-05-18 09:55:16] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 985 ms returned sat
[2021-05-18 09:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 4
[2021-05-18 09:55:20] [INFO ] [Real]Absence check using 91 positive place invariants in 1745 ms returned sat
[2021-05-18 09:55:21] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 990 ms returned sat
[2021-05-18 09:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:22] [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: Broken pipe (>= t10670 0)") while checking expression at index 5
[2021-05-18 09:55:25] [INFO ] [Real]Absence check using 91 positive place invariants in 1799 ms returned sat
[2021-05-18 09:55:26] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 1041 ms returned sat
[2021-05-18 09:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2021-05-18 09:55:29] [INFO ] [Real]Absence check using 91 positive place invariants in 1099 ms returned unsat
[2021-05-18 09:55:32] [INFO ] [Real]Absence check using 91 positive place invariants in 1783 ms returned sat
[2021-05-18 09:55:33] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 1003 ms returned sat
[2021-05-18 09:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 8
[2021-05-18 09:55:37] [INFO ] [Real]Absence check using 91 positive place invariants in 1823 ms returned sat
[2021-05-18 09:55:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 1030 ms returned sat
[2021-05-18 09:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 9
[2021-05-18 09:55:42] [INFO ] [Real]Absence check using 91 positive place invariants in 1468 ms returned unsat
[2021-05-18 09:55:45] [INFO ] [Real]Absence check using 91 positive place invariants in 1872 ms returned sat
[2021-05-18 09:55:46] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 1097 ms returned sat
[2021-05-18 09:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:47] [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: Broken pipe (>= t6697 0)") while checking expression at index 11
[2021-05-18 09:55:50] [INFO ] [Real]Absence check using 91 positive place invariants in 1792 ms returned sat
[2021-05-18 09:55:51] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 972 ms returned sat
[2021-05-18 09:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:55:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 12
FORMULA gen-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 45 out of 17282 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Performed 629 Post agglomeration using F-continuation condition.Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17282 transition count 32491
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16653 transition count 32491
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1258 place count 16653 transition count 32490
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1260 place count 16652 transition count 32490
Symmetric choice reduction at 2 with 7902 rule applications. Total rules 9162 place count 16652 transition count 32490
Deduced a syphon composed of 7902 places in 25 ms
Reduce places removed 7902 places and 15804 transitions.
Iterating global reduction 2 with 15804 rules applied. Total rules applied 24966 place count 8750 transition count 16686
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 14 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 25144 place count 8661 transition count 16597
Free-agglomeration rule applied 148 times.
Iterating global reduction 2 with 148 rules applied. Total rules applied 25292 place count 8661 transition count 16449
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 25440 place count 8513 transition count 16449
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 25472 place count 8513 transition count 16449
Applied a total of 25472 rules in 12990 ms. Remains 8513 /17282 variables (removed 8769) and now considering 16449/33120 (removed 16671) transitions.
Finished structural reductions, in 1 iterations. Remains : 8513/17282 places, 16449/33120 transitions.
Incomplete random walk after 1000000 steps, including 1598 resets, run finished after 27238 ms. (steps per millisecond=36 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
FORMULA gen-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 2724 ms. (steps per millisecond=367 ) properties seen :[0]
// Phase 1: matrix 16449 rows 8513 cols
[2021-05-18 09:56:35] [INFO ] Computed 181 place invariants in 392 ms
[2021-05-18 09:56:37] [INFO ] [Real]Absence check using 91 positive place invariants in 621 ms returned sat
[2021-05-18 09:56:37] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 448 ms returned sat
[2021-05-18 09:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:57:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:57:20] [INFO ] [Real]Absence check using state equation in 43138 ms returned (error "Failed to check-sat")
Support contains 6 out of 8513 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8513/8513 places, 16449/16449 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 8513 transition count 16449
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 8511 transition count 16445
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 34 place count 8497 transition count 16431
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 8495 transition count 16431
Applied a total of 38 rules in 7495 ms. Remains 8495 /8513 variables (removed 18) and now considering 16431/16449 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 8495/8513 places, 16431/16449 transitions.
Interrupted random walk after 976036 steps, including 1561 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 2919 ms. (steps per millisecond=342 ) properties seen :[0]
Interrupted probabilistic random walk after 843504 steps, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :[0]
Probabilistic random walk after 843504 steps, saw 32506 distinct states, run finished after 30001 ms. (steps per millisecond=28 ) properties seen :[0]
// Phase 1: matrix 16431 rows 8495 cols
[2021-05-18 09:58:31] [INFO ] Computed 181 place invariants in 358 ms
[2021-05-18 09:58:32] [INFO ] [Real]Absence check using 91 positive place invariants in 636 ms returned sat
[2021-05-18 09:58:33] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 400 ms returned sat
[2021-05-18 09:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:59:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:59:16] [INFO ] [Real]Absence check using state equation in 43263 ms returned (error "Failed to check-sat")
Support contains 6 out of 8495 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8495/8495 places, 16431/16431 transitions.
Applied a total of 0 rules in 2119 ms. Remains 8495 /8495 variables (removed 0) and now considering 16431/16431 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8495/8495 places, 16431/16431 transitions.
Starting structural reductions, iteration 0 : 8495/8495 places, 16431/16431 transitions.
Applied a total of 0 rules in 2014 ms. Remains 8495 /8495 variables (removed 0) and now considering 16431/16431 (removed 0) transitions.
// Phase 1: matrix 16431 rows 8495 cols
[2021-05-18 09:59:21] [INFO ] Computed 181 place invariants in 343 ms
[2021-05-18 09:59:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:59:52] [INFO ] Performed 2613/8495 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-18 10:00:22] [INFO ] Performed 4846/8495 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2021-05-18 10:00:52] [INFO ] Performed 7111/8495 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2021-05-18 10:01:11] [INFO ] Implicit Places using invariants in 110526 ms returned []
Implicit Place search using SMT only with invariants took 110528 ms to find 0 implicit places.
// Phase 1: matrix 16431 rows 8495 cols
[2021-05-18 10:01:11] [INFO ] Computed 181 place invariants in 350 ms
[2021-05-18 10:01:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:01:42] [INFO ] Performed 2308/16431 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2021-05-18 10:02:11] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= s51 1) (>= s110 1))") after 60362 ms
Finished structural reductions, in 1 iterations. Remains : 8495/8495 places, 16431/16431 transitions.
Incomplete random walk after 100000 steps, including 160 resets, run finished after 2790 ms. (steps per millisecond=35 ) properties seen :[0]
// Phase 1: matrix 16431 rows 8495 cols
[2021-05-18 10:02:14] [INFO ] Computed 181 place invariants in 350 ms
[2021-05-18 10:02:16] [INFO ] [Real]Absence check using 91 positive place invariants in 678 ms returned sat
[2021-05-18 10:02:16] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 484 ms returned sat
[2021-05-18 10:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:02:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 10:02:34] [INFO ] [Real]Absence check using state equation in 18160 ms returned unknown
Graph (trivial) has 16132 edges and 8495 vertex of which 8199 / 8495 are part of one of the 90 SCC in 37 ms
Free SCC test removed 8109 places
Discarding 366 places :
Also discarding 15336 output transitions
Drop transitions removed 15336 transitions
Graph (complete) has 873 edges and 386 vertex of which 20 are kept as prefixes of interest. Removing 366 places using SCC suffix rule.28 ms
Drop transitions removed 1074 transitions
Reduce isomorphic transitions removed 1074 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1075 rules applied. Total rules applied 1077 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1078 place count 19 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1078 place count 19 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1080 place count 18 transition count 19
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 1086 place count 18 transition count 19
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1092 place count 18 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1104 place count 12 transition count 13
Applied a total of 1104 rules in 103 ms. Remains 12 /8495 variables (removed 8483) and now considering 13/16431 (removed 16418) transitions.
// Phase 1: matrix 13 rows 12 cols
[2021-05-18 10:02:35] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-18 10:02:35] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-18 10:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 10:02:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-18 10:02:35] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints in 2 ms.
[2021-05-18 10:02:35] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-18 10:02:36] [INFO ] Flatten gal took : 744 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:02:37] [INFO ] Flatten gal took : 900 ms
[2021-05-18 10:02:37] [INFO ] Applying decomposition
[2021-05-18 10:02:38] [INFO ] Flatten gal took : 623 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="CANConstruction-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is CANConstruction-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r303-tall-162124171000039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;