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.r233-tall-165286037300233.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 ShieldPPPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037300233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 185K 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 ShieldPPPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655073590902

Running Version 0
[2022-06-12 22:39:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:39:52] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-06-12 22:39:52] [INFO ] Transformed 783 places.
[2022-06-12 22:39:52] [INFO ] Transformed 713 transitions.
[2022-06-12 22:39:52] [INFO ] Found NUPN structural information;
[2022-06-12 22:39:52] [INFO ] Parsed PT model containing 783 places and 713 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 15) seen :8
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 713 rows 783 cols
[2022-06-12 22:39:53] [INFO ] Computed 111 place invariants in 19 ms
[2022-06-12 22:39:53] [INFO ] [Real]Absence check using 111 positive place invariants in 57 ms returned sat
[2022-06-12 22:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:39:53] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-06-12 22:39:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:39:54] [INFO ] [Real]Absence check using 111 positive place invariants in 50 ms returned sat
[2022-06-12 22:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:39:54] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-06-12 22:39:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:39:54] [INFO ] [Real]Absence check using 111 positive place invariants in 36 ms returned sat
[2022-06-12 22:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:39:54] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-06-12 22:39:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:39:55] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2022-06-12 22:39:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:39:55] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2022-06-12 22:39:55] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 4 ms to minimize.
[2022-06-12 22:39:55] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2022-06-12 22:39:55] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 13 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 11 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:39:56] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:39:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2515 ms
[2022-06-12 22:39:57] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 40 ms.
[2022-06-12 22:40:00] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2022-06-12 22:40:00] [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-12 22:40:00] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2022-06-12 22:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:00] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-06-12 22:40:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:40:00] [INFO ] [Real]Absence check using 111 positive place invariants in 51 ms returned sat
[2022-06-12 22:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:01] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2022-06-12 22:40:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:40:01] [INFO ] [Nat]Absence check using 111 positive place invariants in 43 ms returned sat
[2022-06-12 22:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:02] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2022-06-12 22:40:02] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-06-12 22:40:02] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:40:02] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2022-06-12 22:40:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:40:04] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2022-06-12 22:40:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2022-06-12 22:40:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-06-12 22:40:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:40:05] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:40:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2753 ms
[2022-06-12 22:40:05] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 39 ms.
[2022-06-12 22:40:06] [INFO ] Added : 175 causal constraints over 35 iterations in 1592 ms. Result :unknown
[2022-06-12 22:40:07] [INFO ] [Real]Absence check using 111 positive place invariants in 33 ms returned sat
[2022-06-12 22:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:07] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-06-12 22:40:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:40:07] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2022-06-12 22:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:07] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-06-12 22:40:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:40:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 47 ms returned sat
[2022-06-12 22:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:40:08] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2022-06-12 22:40:08] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:40:08] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:40:09] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 8 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:40:10] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 3 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 10 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2022-06-12 22:40:11] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:40:12] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:40:12] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2022-06-12 22:40:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2022-06-12 22:40:12] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3579 ms
[2022-06-12 22:40:12] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 22:40:13] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2022-06-12 22:40:13] [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
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 94000 steps, including 301 resets, run finished after 287 ms. (steps per millisecond=327 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 59 out of 783 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 783 transition count 565
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 298 place count 635 transition count 563
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 311 place count 634 transition count 551
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 323 place count 622 transition count 551
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 323 place count 622 transition count 502
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 421 place count 573 transition count 502
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 480 place count 514 transition count 443
Iterating global reduction 4 with 59 rules applied. Total rules applied 539 place count 514 transition count 443
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 539 place count 514 transition count 422
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 581 place count 493 transition count 422
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 5 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 4 with 286 rules applied. Total rules applied 867 place count 350 transition count 279
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 901 place count 333 transition count 279
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 908 place count 333 transition count 272
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 915 place count 326 transition count 272
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 935 place count 326 transition count 272
Applied a total of 935 rules in 235 ms. Remains 326 /783 variables (removed 457) and now considering 272/713 (removed 441) transitions.
Finished structural reductions, in 1 iterations. Remains : 326/783 places, 272/713 transitions.
[2022-06-12 22:40:14] [INFO ] Flatten gal took : 83 ms
[2022-06-12 22:40:14] [INFO ] Flatten gal took : 23 ms
[2022-06-12 22:40:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13621801712909275632.gal : 13 ms
[2022-06-12 22:40:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9922738248760846602.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/ReachabilityCardinality13621801712909275632.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9922738248760846602.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/ReachabilityCardinality13621801712909275632.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9922738248760846602.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9922738248760846602.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 105
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :105 after 951
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :951 after 24331
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :24331 after 8.03168e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.03168e+06 after 8.03433e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.03433e+06 after 8.59559e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.59559e+06 after 1.51276e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.51276e+07 after 1.2379e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.2379e+09 after 4.84459e+11
Detected timeout of ITS tools.
[2022-06-12 22:40:29] [INFO ] Flatten gal took : 23 ms
[2022-06-12 22:40:29] [INFO ] Applying decomposition
[2022-06-12 22:40:29] [INFO ] Flatten gal took : 35 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/graph16720532607899641223.txt, -o, /tmp/graph16720532607899641223.bin, -w, /tmp/graph16720532607899641223.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/graph16720532607899641223.bin, -l, -1, -v, -w, /tmp/graph16720532607899641223.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:40:29] [INFO ] Decomposing Gal with order
[2022-06-12 22:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:40:29] [INFO ] Removed a total of 85 redundant transitions.
[2022-06-12 22:40:29] [INFO ] Flatten gal took : 80 ms
[2022-06-12 22:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 13 ms.
[2022-06-12 22:40:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14994429936685057680.gal : 14 ms
[2022-06-12 22:40:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8760589638810640837.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/ReachabilityCardinality14994429936685057680.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8760589638810640837.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/ReachabilityCardinality14994429936685057680.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8760589638810640837.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8760589638810640837.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 865
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :865 after 281665
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :281665 after 7.35684e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.90455e+09 after 3.69399e+27
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10077428999474135910
[2022-06-12 22:40:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10077428999474135910
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/ltsmin10077428999474135910]
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/ltsmin10077428999474135910] 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/ltsmin10077428999474135910] 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 2 resets, run finished after 2931 ms. (steps per millisecond=341 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1698 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2191 ms. (steps per millisecond=456 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 8599640 steps, run timeout after 30001 ms. (steps per millisecond=286 ) properties seen :{}
Probabilistic random walk after 8599640 steps, saw 4995122 distinct states, run finished after 30005 ms. (steps per millisecond=286 ) properties seen :{}
Running SMT prover for 2 properties.
// Phase 1: matrix 272 rows 326 cols
[2022-06-12 22:41:22] [INFO ] Computed 111 place invariants in 8 ms
[2022-06-12 22:41:22] [INFO ] [Real]Absence check using 111 positive place invariants in 18 ms returned sat
[2022-06-12 22:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:22] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-06-12 22:41:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:41:22] [INFO ] [Nat]Absence check using 111 positive place invariants in 19 ms returned sat
[2022-06-12 22:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:22] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-12 22:41:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-12 22:41:22] [INFO ] [Nat]Added 39 Read/Feed constraints in 25 ms returned sat
[2022-06-12 22:41:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-12 22:41:23] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:41:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2022-06-12 22:41:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2022-06-12 22:41:23] [INFO ] Computed and/alt/rep : 271/823/271 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 22:41:24] [INFO ] Added : 212 causal constraints over 44 iterations in 1312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 22:41:24] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2022-06-12 22:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:24] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-12 22:41:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:41:24] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2022-06-12 22:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:41:24] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-12 22:41:24] [INFO ] [Nat]Added 39 Read/Feed constraints in 14 ms returned sat
[2022-06-12 22:41:24] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-12 22:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-06-12 22:41:24] [INFO ] Computed and/alt/rep : 271/823/271 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 22:41:26] [INFO ] Added : 261 causal constraints over 54 iterations in 1742 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 37700 steps, including 421 resets, run finished after 108 ms. (steps per millisecond=349 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 370 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=185 )
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655073687792

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-010B, 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 r233-tall-165286037300233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B 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 ;