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.r216-tall-162098205600796.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 itstools
Input is ShieldPPPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 376K May 5 16:52 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-020B-00
FORMULA_NAME ShieldPPPt-PT-020B-01
FORMULA_NAME ShieldPPPt-PT-020B-02
FORMULA_NAME ShieldPPPt-PT-020B-03
FORMULA_NAME ShieldPPPt-PT-020B-04
FORMULA_NAME ShieldPPPt-PT-020B-05
FORMULA_NAME ShieldPPPt-PT-020B-06
FORMULA_NAME ShieldPPPt-PT-020B-07
FORMULA_NAME ShieldPPPt-PT-020B-08
FORMULA_NAME ShieldPPPt-PT-020B-09
FORMULA_NAME ShieldPPPt-PT-020B-10
FORMULA_NAME ShieldPPPt-PT-020B-11
FORMULA_NAME ShieldPPPt-PT-020B-12
FORMULA_NAME ShieldPPPt-PT-020B-13
FORMULA_NAME ShieldPPPt-PT-020B-14
FORMULA_NAME ShieldPPPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621178474200

Running Version 0
[2021-05-16 15:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2021-05-16 15:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:21:15] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2021-05-16 15:21:16] [INFO ] Transformed 1563 places.
[2021-05-16 15:21:16] [INFO ] Transformed 1423 transitions.
[2021-05-16 15:21:16] [INFO ] Found NUPN structural information;
[2021-05-16 15:21:16] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:21:16] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldPPPt-PT-020B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 590 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2021-05-16 15:21:16] [INFO ] Computed 221 place invariants in 29 ms
[2021-05-16 15:21:17] [INFO ] Implicit Places using invariants in 614 ms returned []
// Phase 1: matrix 1205 rows 1345 cols
[2021-05-16 15:21:17] [INFO ] Computed 221 place invariants in 8 ms
[2021-05-16 15:21:18] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
// Phase 1: matrix 1205 rows 1345 cols
[2021-05-16 15:21:18] [INFO ] Computed 221 place invariants in 5 ms
[2021-05-16 15:21:18] [INFO ] Dead Transitions using invariants and state equation in 614 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1345/1563 places, 1205/1423 transitions.
[2021-05-16 15:21:19] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 15:21:19] [INFO ] Flatten gal took : 124 ms
FORMULA ShieldPPPt-PT-020B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:21:19] [INFO ] Flatten gal took : 64 ms
[2021-05-16 15:21:19] [INFO ] Input system was already deterministic with 1205 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=154 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 1205 rows 1345 cols
[2021-05-16 15:21:20] [INFO ] Computed 221 place invariants in 4 ms
[2021-05-16 15:21:20] [INFO ] [Real]Absence check using 221 positive place invariants in 58 ms returned sat
[2021-05-16 15:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:20] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2021-05-16 15:21:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:21:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 59 ms returned sat
[2021-05-16 15:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:21] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2021-05-16 15:21:21] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 5 ms to minimize.
[2021-05-16 15:21:22] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 1 ms to minimize.
[2021-05-16 15:21:22] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 1 ms to minimize.
[2021-05-16 15:21:22] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 2 ms to minimize.
[2021-05-16 15:21:23] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 4 ms to minimize.
[2021-05-16 15:21:23] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 13 ms to minimize.
[2021-05-16 15:21:23] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 9 ms to minimize.
[2021-05-16 15:21:23] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2021-05-16 15:21:24] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 2 ms to minimize.
[2021-05-16 15:21:24] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2021-05-16 15:21:24] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2021-05-16 15:21:24] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2021-05-16 15:21:25] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2021-05-16 15:21:25] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 9 ms to minimize.
[2021-05-16 15:21:25] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 1 ms to minimize.
[2021-05-16 15:21:25] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2021-05-16 15:21:25] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2021-05-16 15:21:26] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 1 ms to minimize.
[2021-05-16 15:21:26] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2021-05-16 15:21:26] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2021-05-16 15:21:26] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-16 15:21:26] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2021-05-16 15:21:27] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 5 ms to minimize.
[2021-05-16 15:21:28] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 7290 ms
[2021-05-16 15:21:28] [INFO ] Computed and/alt/rep : 1204/1787/1204 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-16 15:21:41] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2021-05-16 15:21:41] [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 0
[2021-05-16 15:21:41] [INFO ] [Real]Absence check using 221 positive place invariants in 59 ms returned sat
[2021-05-16 15:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:42] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2021-05-16 15:21:42] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2021-05-16 15:21:42] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2021-05-16 15:21:42] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2021-05-16 15:21:43] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 1 ms to minimize.
[2021-05-16 15:21:43] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2021-05-16 15:21:43] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 0 ms to minimize.
[2021-05-16 15:21:43] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 0 ms to minimize.
[2021-05-16 15:21:44] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2021-05-16 15:21:44] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2021-05-16 15:21:44] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2021-05-16 15:21:44] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 0 ms to minimize.
[2021-05-16 15:21:44] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 1 ms to minimize.
[2021-05-16 15:21:45] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2021-05-16 15:21:45] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2021-05-16 15:21:45] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 1 ms to minimize.
[2021-05-16 15:21:45] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2021-05-16 15:21:45] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 8 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2021-05-16 15:21:46] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2021-05-16 15:21:47] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2021-05-16 15:21:48] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2021-05-16 15:21:48] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6033 ms
[2021-05-16 15:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:21:48] [INFO ] [Nat]Absence check using 221 positive place invariants in 55 ms returned sat
[2021-05-16 15:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:21:48] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2021-05-16 15:21:48] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 1 ms to minimize.
[2021-05-16 15:21:49] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2021-05-16 15:21:49] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2021-05-16 15:21:49] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2021-05-16 15:21:49] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2021-05-16 15:21:50] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 0 ms to minimize.
[2021-05-16 15:21:50] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 1 ms to minimize.
[2021-05-16 15:21:50] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 1 ms to minimize.
[2021-05-16 15:21:50] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 0 ms to minimize.
[2021-05-16 15:21:51] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 0 ms to minimize.
[2021-05-16 15:21:51] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2021-05-16 15:21:51] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2021-05-16 15:21:51] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2021-05-16 15:21:51] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2021-05-16 15:21:52] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2021-05-16 15:21:52] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2021-05-16 15:21:52] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2021-05-16 15:21:52] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 0 ms to minimize.
[2021-05-16 15:21:52] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2021-05-16 15:21:53] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2021-05-16 15:21:53] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2021-05-16 15:21:53] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2021-05-16 15:21:53] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2021-05-16 15:21:53] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 1 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 1 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2021-05-16 15:21:54] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2021-05-16 15:21:55] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 7057 ms
[2021-05-16 15:21:55] [INFO ] Computed and/alt/rep : 1204/1787/1204 causal constraints (skipped 0 transitions) in 56 ms.
[2021-05-16 15:22:08] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2021-05-16 15:22:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-16 15:22:08] [INFO ] [Real]Absence check using 221 positive place invariants in 56 ms returned sat
[2021-05-16 15:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:09] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-16 15:22:09] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2021-05-16 15:22:09] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 0 ms to minimize.
[2021-05-16 15:22:09] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2021-05-16 15:22:10] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2021-05-16 15:22:10] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2021-05-16 15:22:10] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2021-05-16 15:22:10] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2021-05-16 15:22:11] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2021-05-16 15:22:11] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2021-05-16 15:22:11] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2021-05-16 15:22:11] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2021-05-16 15:22:11] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2021-05-16 15:22:12] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2021-05-16 15:22:13] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-16 15:22:14] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4738 ms
[2021-05-16 15:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:14] [INFO ] [Nat]Absence check using 221 positive place invariants in 56 ms returned sat
[2021-05-16 15:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:14] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2021-05-16 15:22:14] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 1 ms to minimize.
[2021-05-16 15:22:15] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2021-05-16 15:22:16] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 0 ms to minimize.
[2021-05-16 15:22:17] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2021-05-16 15:22:18] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2021-05-16 15:22:19] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5107 ms
[2021-05-16 15:22:19] [INFO ] Computed and/alt/rep : 1204/1787/1204 causal constraints (skipped 0 transitions) in 69 ms.
[2021-05-16 15:22:34] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 1 ms to minimize.
[2021-05-16 15:22:34] [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
[2021-05-16 15:22:34] [INFO ] [Real]Absence check using 221 positive place invariants in 55 ms returned sat
[2021-05-16 15:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:35] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2021-05-16 15:22:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 58 ms returned sat
[2021-05-16 15:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:35] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2021-05-16 15:22:36] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2021-05-16 15:22:36] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 1 ms to minimize.
[2021-05-16 15:22:36] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2021-05-16 15:22:36] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 1 ms to minimize.
[2021-05-16 15:22:37] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2021-05-16 15:22:37] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 0 ms to minimize.
[2021-05-16 15:22:37] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 0 ms to minimize.
[2021-05-16 15:22:38] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2021-05-16 15:22:38] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2021-05-16 15:22:38] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2021-05-16 15:22:38] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2021-05-16 15:22:38] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-16 15:22:39] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2021-05-16 15:22:39] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2021-05-16 15:22:39] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2021-05-16 15:22:39] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2021-05-16 15:22:40] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2021-05-16 15:22:40] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2021-05-16 15:22:40] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 8 ms to minimize.
[2021-05-16 15:22:40] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2021-05-16 15:22:40] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2021-05-16 15:22:41] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 0 ms to minimize.
[2021-05-16 15:22:41] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2021-05-16 15:22:41] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
[2021-05-16 15:22:41] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2021-05-16 15:22:41] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2021-05-16 15:22:42] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2021-05-16 15:22:43] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 8091 ms
[2021-05-16 15:22:44] [INFO ] Computed and/alt/rep : 1204/1787/1204 causal constraints (skipped 0 transitions) in 57 ms.
[2021-05-16 15:22:55] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2021-05-16 15:22:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-16 15:22:55] [INFO ] [Real]Absence check using 221 positive place invariants in 61 ms returned sat
[2021-05-16 15:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:56] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2021-05-16 15:22:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:56] [INFO ] [Nat]Absence check using 221 positive place invariants in 26 ms returned unsat
[2021-05-16 15:22:56] [INFO ] [Real]Absence check using 221 positive place invariants in 60 ms returned sat
[2021-05-16 15:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:57] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-16 15:22:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 25 ms returned unsat
[2021-05-16 15:22:57] [INFO ] [Real]Absence check using 221 positive place invariants in 59 ms returned sat
[2021-05-16 15:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:58] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2021-05-16 15:22:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:22:58] [INFO ] [Nat]Absence check using 221 positive place invariants in 54 ms returned sat
[2021-05-16 15:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:22:58] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2021-05-16 15:22:58] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2021-05-16 15:22:59] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 0 ms to minimize.
[2021-05-16 15:22:59] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 0 ms to minimize.
[2021-05-16 15:22:59] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2021-05-16 15:22:59] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2021-05-16 15:23:00] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2021-05-16 15:23:00] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2021-05-16 15:23:00] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 1 ms to minimize.
[2021-05-16 15:23:00] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2021-05-16 15:23:01] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2021-05-16 15:23:01] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2021-05-16 15:23:01] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2021-05-16 15:23:01] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2021-05-16 15:23:02] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2021-05-16 15:23:02] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2021-05-16 15:23:02] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2021-05-16 15:23:02] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2021-05-16 15:23:02] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2021-05-16 15:23:03] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 0 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2021-05-16 15:23:04] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6168 ms
[2021-05-16 15:23:04] [INFO ] Computed and/alt/rep : 1204/1787/1204 causal constraints (skipped 0 transitions) in 67 ms.
[2021-05-16 15:23:18] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2021-05-16 15:23:18] [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
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
[2021-05-16 15:23:18] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldPPPt-PT-020B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1344 transition count 928
Reduce places removed 276 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 278 rules applied. Total rules applied 554 place count 1068 transition count 926
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 556 place count 1066 transition count 926
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 556 place count 1066 transition count 768
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 872 place count 908 transition count 768
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 876 place count 904 transition count 764
Iterating global reduction 3 with 4 rules applied. Total rules applied 880 place count 904 transition count 764
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 880 place count 904 transition count 760
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 888 place count 900 transition count 760
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 3 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1558 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1561 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 506 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1679 place count 504 transition count 420
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1683 place count 502 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1684 place count 501 transition count 419
Applied a total of 1684 rules in 303 ms. Remains 501 /1345 variables (removed 844) and now considering 419/1205 (removed 786) transitions.
// Phase 1: matrix 419 rows 501 cols
[2021-05-16 15:23:18] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:23:19] [INFO ] Implicit Places using invariants in 290 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
[2021-05-16 15:23:19] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 419 rows 499 cols
[2021-05-16 15:23:19] [INFO ] Computed 218 place invariants in 7 ms
[2021-05-16 15:23:19] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Starting structural reductions, iteration 1 : 499/1345 places, 419/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 417
Applied a total of 4 rules in 24 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2021-05-16 15:23:19] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:19] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 417 rows 497 cols
[2021-05-16 15:23:19] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 15:23:20] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 497/1345 places, 417/1205 transitions.
Stuttering acceptance computed with spot in 3299 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 623 ms.
Stack based approach found an accepted trace after 37707 steps with 0 reset with depth 37708 and stack size 32942 in 235 ms.
FORMULA ShieldPPPt-PT-020B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-01 finished in 5861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1344 transition count 927
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 1067 transition count 927
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 554 place count 1067 transition count 770
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 868 place count 910 transition count 770
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 872 place count 906 transition count 766
Iterating global reduction 2 with 4 rules applied. Total rules applied 876 place count 906 transition count 766
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 876 place count 906 transition count 762
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 884 place count 902 transition count 762
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1556 place count 566 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1557 place count 566 transition count 425
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 565 transition count 424
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1675 place count 507 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1676 place count 506 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1677 place count 505 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1677 place count 505 transition count 421
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1681 place count 503 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1682 place count 502 transition count 420
Applied a total of 1682 rules in 204 ms. Remains 502 /1345 variables (removed 843) and now considering 420/1205 (removed 785) transitions.
// Phase 1: matrix 420 rows 502 cols
[2021-05-16 15:23:24] [INFO ] Computed 220 place invariants in 2 ms
[2021-05-16 15:23:24] [INFO ] Implicit Places using invariants in 276 ms returned [485, 489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 278 ms to find 2 implicit places.
[2021-05-16 15:23:24] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 420 rows 500 cols
[2021-05-16 15:23:24] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:25] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Starting structural reductions, iteration 1 : 500/1345 places, 420/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 418
Applied a total of 4 rules in 20 ms. Remains 498 /500 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 498 cols
[2021-05-16 15:23:25] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:25] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 418 rows 498 cols
[2021-05-16 15:23:25] [INFO ] Computed 218 place invariants in 2 ms
[2021-05-16 15:23:25] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 498/1345 places, 418/1205 transitions.
Stuttering acceptance computed with spot in 2761 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s47 1), p0:(EQ s144 1), p2:(OR (EQ s128 0) (EQ s437 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 562 ms.
Product exploration explored 100000 steps with 14 reset in 637 ms.
Knowledge obtained : [(NOT p1), (NOT p0), p2]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10 reset in 517 ms.
Product exploration explored 100000 steps with 7 reset in 618 ms.
[2021-05-16 15:23:31] [INFO ] Flatten gal took : 22 ms
[2021-05-16 15:23:31] [INFO ] Flatten gal took : 22 ms
[2021-05-16 15:23:31] [INFO ] Time to serialize gal into /tmp/LTL10868324688415649470.gal : 10 ms
[2021-05-16 15:23:31] [INFO ] Time to serialize properties into /tmp/LTL5429705344639587742.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10868324688415649470.gal, -t, CGAL, -LTL, /tmp/LTL5429705344639587742.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10868324688415649470.gal -t CGAL -LTL /tmp/LTL5429705344639587742.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("(p436==1)")||(G("(p139==1)")))||(G("((p401==0)||(p1348==1))"))))))
Formula 0 simplified : !GF("(p436==1)" | G"(p139==1)" | G"((p401==0)||(p1348==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.24961e+32 deadlock states
Detected timeout of ITS tools.
[2021-05-16 15:23:46] [INFO ] Flatten gal took : 38 ms
[2021-05-16 15:23:46] [INFO ] Applying decomposition
[2021-05-16 15:23:46] [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/graph11484084790319151199.txt, -o, /tmp/graph11484084790319151199.bin, -w, /tmp/graph11484084790319151199.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/graph11484084790319151199.bin, -l, -1, -v, -w, /tmp/graph11484084790319151199.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:23:49] [INFO ] Decomposing Gal with order
[2021-05-16 15:23:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:23:49] [INFO ] Removed a total of 128 redundant transitions.
[2021-05-16 15:23:49] [INFO ] Flatten gal took : 135 ms
[2021-05-16 15:23:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 20 ms.
[2021-05-16 15:23:49] [INFO ] Time to serialize gal into /tmp/LTL12832785746285693960.gal : 9 ms
[2021-05-16 15:23:49] [INFO ] Time to serialize properties into /tmp/LTL13667706906275672960.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12832785746285693960.gal, -t, CGAL, -LTL, /tmp/LTL13667706906275672960.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12832785746285693960.gal -t CGAL -LTL /tmp/LTL13667706906275672960.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i5.i1.u47.p436==1)")||(G("(i1.i1.u16.p139==1)")))||(G("((i4.i1.u41.p401==0)||(i17.i0.u141.p1348==1))"))))))
Formula 0 simplified : !GF("(i5.i1.u47.p436==1)" | G"(i1.i1.u16.p139==1)" | G"((i4.i1.u41.p401==0)||(i17.i0.u141.p1348==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.24961e+32 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
325 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.30459,107728,1,0,172654,300,2347,479788,243,1698,146577
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-03 finished in 29039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1341 transition count 1201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1341 transition count 1201
Applied a total of 8 rules in 117 ms. Remains 1341 /1345 variables (removed 4) and now considering 1201/1205 (removed 4) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:53] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:54] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:54] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:55] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2021-05-16 15:23:55] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:23:55] [INFO ] Dead Transitions using invariants and state equation in 610 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1341/1345 places, 1201/1205 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s916 0) (EQ s938 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3178 steps with 0 reset in 15 ms.
FORMULA ShieldPPPt-PT-020B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-11 finished in 2437 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1344 transition count 925
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 157 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 157 Pre rules applied. Total rules applied 558 place count 1065 transition count 768
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 872 place count 908 transition count 768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 875 place count 905 transition count 765
Iterating global reduction 2 with 3 rules applied. Total rules applied 878 place count 905 transition count 765
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 878 place count 905 transition count 762
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 884 place count 902 transition count 762
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1560 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1563 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1681 place count 504 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1682 place count 503 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1683 place count 502 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1683 place count 502 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1687 place count 500 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1688 place count 499 transition count 418
Applied a total of 1688 rules in 235 ms. Remains 499 /1345 variables (removed 846) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 499 cols
[2021-05-16 15:23:56] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:23:56] [INFO ] Implicit Places using invariants in 277 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
[2021-05-16 15:23:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 418 rows 497 cols
[2021-05-16 15:23:56] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:56] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Starting structural reductions, iteration 1 : 497/1345 places, 418/1205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 17 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2021-05-16 15:23:56] [INFO ] Computed 218 place invariants in 10 ms
[2021-05-16 15:23:56] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 416 rows 495 cols
[2021-05-16 15:23:56] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:23:57] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 495/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s176 0) (NEQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 476 ms.
Stack based approach found an accepted trace after 267 steps with 0 reset with depth 268 and stack size 268 in 2 ms.
FORMULA ShieldPPPt-PT-020B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-15 finished in 2033 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621178643383

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205600796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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