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-162098205100444.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 ShieldIIPt-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-162098205100444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 338K 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 ShieldIIPt-PT-020B-00
FORMULA_NAME ShieldIIPt-PT-020B-01
FORMULA_NAME ShieldIIPt-PT-020B-02
FORMULA_NAME ShieldIIPt-PT-020B-03
FORMULA_NAME ShieldIIPt-PT-020B-04
FORMULA_NAME ShieldIIPt-PT-020B-05
FORMULA_NAME ShieldIIPt-PT-020B-06
FORMULA_NAME ShieldIIPt-PT-020B-07
FORMULA_NAME ShieldIIPt-PT-020B-08
FORMULA_NAME ShieldIIPt-PT-020B-09
FORMULA_NAME ShieldIIPt-PT-020B-10
FORMULA_NAME ShieldIIPt-PT-020B-11
FORMULA_NAME ShieldIIPt-PT-020B-12
FORMULA_NAME ShieldIIPt-PT-020B-13
FORMULA_NAME ShieldIIPt-PT-020B-14
FORMULA_NAME ShieldIIPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621103207679

Running Version 0
[2021-05-15 18:26:57] [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-15 18:26:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 18:26:57] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-15 18:26:57] [INFO ] Transformed 1403 places.
[2021-05-15 18:26:57] [INFO ] Transformed 1303 transitions.
[2021-05-15 18:26:57] [INFO ] Found NUPN structural information;
[2021-05-15 18:26:57] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 207 place count 1196 transition count 1096
Iterating global reduction 0 with 207 rules applied. Total rules applied 414 place count 1196 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 415 place count 1195 transition count 1095
Iterating global reduction 0 with 1 rules applied. Total rules applied 416 place count 1195 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 1194 transition count 1094
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 1194 transition count 1094
Applied a total of 418 rules in 500 ms. Remains 1194 /1403 variables (removed 209) and now considering 1094/1303 (removed 209) transitions.
// Phase 1: matrix 1094 rows 1194 cols
[2021-05-15 18:26:58] [INFO ] Computed 181 place invariants in 29 ms
[2021-05-15 18:26:59] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 1094 rows 1194 cols
[2021-05-15 18:26:59] [INFO ] Computed 181 place invariants in 10 ms
[2021-05-15 18:26:59] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
// Phase 1: matrix 1094 rows 1194 cols
[2021-05-15 18:26:59] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:27:00] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1194/1403 places, 1094/1303 transitions.
[2021-05-15 18:27:00] [INFO ] Flatten gal took : 100 ms
[2021-05-15 18:27:00] [INFO ] Flatten gal took : 57 ms
[2021-05-15 18:27:00] [INFO ] Input system was already deterministic with 1094 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=145 ) properties (out of 28) seen :22
Running SMT prover for 6 properties.
// Phase 1: matrix 1094 rows 1194 cols
[2021-05-15 18:27:06] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:27:06] [INFO ] [Real]Absence check using 181 positive place invariants in 53 ms returned sat
[2021-05-15 18:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:07] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2021-05-15 18:27:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:27:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 57 ms returned sat
[2021-05-15 18:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:07] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2021-05-15 18:27:08] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 3 ms to minimize.
[2021-05-15 18:27:08] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2021-05-15 18:27:08] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 1 ms to minimize.
[2021-05-15 18:27:08] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2021-05-15 18:27:09] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 1 ms to minimize.
[2021-05-15 18:27:09] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2021-05-15 18:27:09] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2021-05-15 18:27:09] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2021-05-15 18:27:09] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 1 ms to minimize.
[2021-05-15 18:27:10] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 0 ms to minimize.
[2021-05-15 18:27:10] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:27:10] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2021-05-15 18:27:10] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:27:10] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:27:11] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2021-05-15 18:27:11] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2021-05-15 18:27:11] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2021-05-15 18:27:11] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2021-05-15 18:27:11] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2021-05-15 18:27:12] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2021-05-15 18:27:13] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5871 ms
[2021-05-15 18:27:13] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 57 ms.
[2021-05-15 18:27:27] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 1 ms to minimize.
[2021-05-15 18:27:27] [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-15 18:27:27] [INFO ] [Real]Absence check using 181 positive place invariants in 48 ms returned sat
[2021-05-15 18:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:28] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2021-05-15 18:27:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:27:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 47 ms returned sat
[2021-05-15 18:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:28] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2021-05-15 18:27:28] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:27:29] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 4 ms to minimize.
[2021-05-15 18:27:29] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2021-05-15 18:27:29] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2021-05-15 18:27:29] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2021-05-15 18:27:29] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2021-05-15 18:27:30] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2021-05-15 18:27:30] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2021-05-15 18:27:30] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2021-05-15 18:27:30] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2021-05-15 18:27:30] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2021-05-15 18:27:31] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2021-05-15 18:27:31] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2021-05-15 18:27:31] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:27:31] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2021-05-15 18:27:31] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2021-05-15 18:27:32] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 7 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2021-05-15 18:27:33] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2021-05-15 18:27:34] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6007 ms
[2021-05-15 18:27:34] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 63 ms.
[2021-05-15 18:27:48] [INFO ] Added : 1055 causal constraints over 211 iterations in 13431 ms. Result :unknown
[2021-05-15 18:27:48] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:48] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2021-05-15 18:27:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:27:48] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:27:49] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-15 18:27:49] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2021-05-15 18:27:49] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 10 ms to minimize.
[2021-05-15 18:27:49] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:27:50] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 0 ms to minimize.
[2021-05-15 18:27:50] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2021-05-15 18:27:50] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2021-05-15 18:27:50] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2021-05-15 18:27:50] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2021-05-15 18:27:51] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2021-05-15 18:27:52] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-15 18:27:53] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:27:53] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2021-05-15 18:27:53] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2021-05-15 18:27:53] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4181 ms
[2021-05-15 18:27:53] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 56 ms.
[2021-05-15 18:28:09] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 1 ms to minimize.
[2021-05-15 18:28:09] [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-15 18:28:09] [INFO ] [Real]Absence check using 181 positive place invariants in 43 ms returned sat
[2021-05-15 18:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:09] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2021-05-15 18:28:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:09] [INFO ] [Nat]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:10] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-15 18:28:10] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:28:10] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 1 ms to minimize.
[2021-05-15 18:28:10] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 1 ms to minimize.
[2021-05-15 18:28:11] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2021-05-15 18:28:11] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-15 18:28:11] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2021-05-15 18:28:11] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2021-05-15 18:28:11] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2021-05-15 18:28:12] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2021-05-15 18:28:12] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2021-05-15 18:28:12] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2021-05-15 18:28:12] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2021-05-15 18:28:12] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2021-05-15 18:28:13] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2021-05-15 18:28:13] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2021-05-15 18:28:13] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2021-05-15 18:28:13] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:28:13] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2021-05-15 18:28:14] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2021-05-15 18:28:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2021-05-15 18:28:16] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6196 ms
[2021-05-15 18:28:16] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 59 ms.
[2021-05-15 18:28:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 18:28:29] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:30] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2021-05-15 18:28:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:30] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:30] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2021-05-15 18:28:30] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 1 ms to minimize.
[2021-05-15 18:28:31] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2021-05-15 18:28:31] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2021-05-15 18:28:31] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2021-05-15 18:28:31] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2021-05-15 18:28:32] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2021-05-15 18:28:32] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2021-05-15 18:28:32] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2021-05-15 18:28:32] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 1 ms to minimize.
[2021-05-15 18:28:32] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2021-05-15 18:28:33] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2021-05-15 18:28:34] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-15 18:28:35] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5162 ms
[2021-05-15 18:28:35] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 54 ms.
[2021-05-15 18:28:50] [INFO ] Added : 1055 causal constraints over 211 iterations in 14338 ms. Result :unknown
[2021-05-15 18:28:50] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2021-05-15 18:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:50] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-15 18:28:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 18:28:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2021-05-15 18:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 18:28:51] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-15 18:28:51] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2021-05-15 18:28:51] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2021-05-15 18:28:52] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2021-05-15 18:28:52] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 0 ms to minimize.
[2021-05-15 18:28:52] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 0 ms to minimize.
[2021-05-15 18:28:52] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 1 ms to minimize.
[2021-05-15 18:28:52] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2021-05-15 18:28:53] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2021-05-15 18:28:53] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2021-05-15 18:28:53] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2021-05-15 18:28:53] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2021-05-15 18:28:54] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2021-05-15 18:28:55] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2021-05-15 18:28:55] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2021-05-15 18:28:55] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2021-05-15 18:28:55] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2021-05-15 18:28:55] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2021-05-15 18:28:56] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2021-05-15 18:28:57] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5916 ms
[2021-05-15 18:28:57] [INFO ] Computed and/alt/rep : 1093/1641/1093 causal constraints (skipped 0 transitions) in 58 ms.
[2021-05-15 18:29:11] [INFO ] Deduced a trap composed of 19 places in 440 ms of which 1 ms to minimize.
[2021-05-15 18:29:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||G(p1))) U (p2&&X(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1183 transition count 1083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1183 transition count 1083
Applied a total of 22 rules in 61 ms. Remains 1183 /1194 variables (removed 11) and now considering 1083/1094 (removed 11) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:29:21] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 18:29:21] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:29:21] [INFO ] Computed 181 place invariants in 4 ms
[2021-05-15 18:29:22] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:29:22] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:29:22] [INFO ] Dead Transitions using invariants and state equation in 574 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1183/1194 places, 1083/1094 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-020B-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 5}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=1 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=1 dest: 8}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={0} source=6 dest: 8}], [{ cond=(AND p2 (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=7 dest: 4}], [{ cond=(OR (AND p2 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=8 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={} source=8 dest: 3}]], initial=0, aps=[p2:(OR (EQ s537 0) (EQ s68 1)), p0:(AND (EQ s49 0) (EQ s930 1)), p1:(AND (NEQ s930 0) (NEQ s49 1)), p3:(NEQ s751 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 639 ms.
Product exploration explored 100000 steps with 33333 reset in 589 ms.
Knowledge obtained : [p2, (NOT p0), (NOT p1), p3]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 33333 reset in 506 ms.
Product exploration explored 100000 steps with 33333 reset in 510 ms.
Applying partial POR strategy [false, false, true, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 1183 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1183/1183 places, 1083/1083 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1183 transition count 1083
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 237 place count 1183 transition count 1200
Deduced a syphon composed of 335 places in 1 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 335 place count 1183 transition count 1200
Performed 382 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 717 places in 1 ms
Iterating global reduction 1 with 382 rules applied. Total rules applied 717 place count 1183 transition count 1201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 718 place count 1183 transition count 1200
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 2 with 141 rule applications. Total rules 859 place count 1042 transition count 1059
Deduced a syphon composed of 576 places in 0 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 1000 place count 1042 transition count 1059
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 577 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1001 place count 1042 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1003 place count 1040 transition count 1057
Deduced a syphon composed of 575 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1005 place count 1040 transition count 1057
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 635 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1065 place count 1040 transition count 1387
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1125 place count 980 transition count 1267
Deduced a syphon composed of 575 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1185 place count 980 transition count 1267
Deduced a syphon composed of 575 places in 0 ms
Applied a total of 1185 rules in 646 ms. Remains 980 /1183 variables (removed 203) and now considering 1267/1083 (removed -184) transitions.
[2021-05-15 18:29:26] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 1267 rows 980 cols
[2021-05-15 18:29:27] [INFO ] Computed 181 place invariants in 7 ms
[2021-05-15 18:29:27] [INFO ] Dead Transitions using invariants and state equation in 636 ms returned []
Finished structural reductions, in 1 iterations. Remains : 980/1183 places, 1267/1083 transitions.
Product exploration explored 100000 steps with 33333 reset in 2374 ms.
Product exploration explored 100000 steps with 33333 reset in 2278 ms.
[2021-05-15 18:29:39] [INFO ] Flatten gal took : 46 ms
[2021-05-15 18:29:39] [INFO ] Flatten gal took : 44 ms
[2021-05-15 18:29:39] [INFO ] Time to serialize gal into /tmp/LTL6332540225779795367.gal : 729 ms
[2021-05-15 18:29:40] [INFO ] Time to serialize properties into /tmp/LTL1824354276814144201.ltl : 458 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/LTL6332540225779795367.gal, -t, CGAL, -LTL, /tmp/LTL1824354276814144201.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/LTL6332540225779795367.gal -t CGAL -LTL /tmp/LTL1824354276814144201.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G((G("((p1097!=0)&&(p49!=1))"))||("((p49==0)&&(p1097==1))")))U((X("(p882!=1)"))&&("((p630==0)||(p72==1))")))))
Formula 0 simplified : !X(G("((p49==0)&&(p1097==1))" | G"((p1097!=0)&&(p49!=1))") U ("((p630==0)||(p72==1))" & X"(p882!=1)"))
Detected timeout of ITS tools.
[2021-05-15 18:29:55] [INFO ] Flatten gal took : 42 ms
[2021-05-15 18:29:55] [INFO ] Applying decomposition
[2021-05-15 18:29:55] [INFO ] Flatten gal took : 40 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/graph9073064379118519741.txt, -o, /tmp/graph9073064379118519741.bin, -w, /tmp/graph9073064379118519741.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/graph9073064379118519741.bin, -l, -1, -v, -w, /tmp/graph9073064379118519741.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:29:55] [INFO ] Decomposing Gal with order
[2021-05-15 18:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:29:55] [INFO ] Removed a total of 201 redundant transitions.
[2021-05-15 18:29:55] [INFO ] Flatten gal took : 119 ms
[2021-05-15 18:29:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-15 18:29:55] [INFO ] Time to serialize gal into /tmp/LTL403042851869233438.gal : 16 ms
[2021-05-15 18:29:55] [INFO ] Time to serialize properties into /tmp/LTL4777202532947784926.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL403042851869233438.gal, -t, CGAL, -LTL, /tmp/LTL4777202532947784926.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/LTL403042851869233438.gal -t CGAL -LTL /tmp/LTL4777202532947784926.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G((G("((i16.i4.u346.p1097!=0)&&(i1.i5.u20.p49!=1))"))||("((i1.i5.u20.p49==0)&&(i16.i4.u346.p1097==1))")))U((X("(i13.i4.u279.p882!=1)"))&&("((i9.i5.u200.p630==0)||(i1.i7.u32.p72==1))")))))
Formula 0 simplified : !X(G("((i1.i5.u20.p49==0)&&(i16.i4.u346.p1097==1))" | G"((i16.i4.u346.p1097!=0)&&(i1.i5.u20.p49!=1))") U ("((i9.i5.u200.p630==0)||(i1.i7.u32.p72==1))" & X"(i13.i4.u279.p882!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6986310041981530403
[2021-05-15 18:30:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6986310041981530403
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/ltsmin6986310041981530403]
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/ltsmin6986310041981530403] 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/ltsmin6986310041981530403] 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)
Treatment of property ShieldIIPt-PT-020B-00 finished in 60662 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1181 transition count 1081
Applied a total of 26 rules in 59 ms. Remains 1181 /1194 variables (removed 13) and now considering 1081/1094 (removed 13) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:30:12] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:12] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:30:12] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:13] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:30:13] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:13] [INFO ] Dead Transitions using invariants and state equation in 505 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1194 places, 1081/1094 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s321 0) (EQ s627 1)), p2:(EQ s656 1), p0:(EQ s607 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 451 ms.
Product exploration explored 100000 steps with 33333 reset in 460 ms.
Knowledge obtained : [p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 451 ms.
Product exploration explored 100000 steps with 33333 reset in 466 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 1181 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1181 transition count 1081
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 238 place count 1181 transition count 1204
Deduced a syphon composed of 339 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 339 place count 1181 transition count 1204
Performed 375 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 714 places in 1 ms
Iterating global reduction 1 with 375 rules applied. Total rules applied 714 place count 1181 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 715 place count 1181 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 854 place count 1042 transition count 1064
Deduced a syphon composed of 575 places in 0 ms
Iterating global reduction 2 with 139 rules applied. Total rules applied 993 place count 1042 transition count 1064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 576 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 994 place count 1042 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 996 place count 1040 transition count 1062
Deduced a syphon composed of 574 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 998 place count 1040 transition count 1062
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -317
Deduced a syphon composed of 633 places in 0 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1057 place count 1040 transition count 1379
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 1116 place count 981 transition count 1261
Deduced a syphon composed of 574 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1175 place count 981 transition count 1261
Deduced a syphon composed of 574 places in 1 ms
Applied a total of 1175 rules in 322 ms. Remains 981 /1181 variables (removed 200) and now considering 1261/1081 (removed -180) transitions.
[2021-05-15 18:30:16] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1261 rows 981 cols
[2021-05-15 18:30:16] [INFO ] Computed 181 place invariants in 6 ms
[2021-05-15 18:30:17] [INFO ] Dead Transitions using invariants and state equation in 517 ms returned []
Finished structural reductions, in 1 iterations. Remains : 981/1181 places, 1261/1081 transitions.
Product exploration explored 100000 steps with 33333 reset in 2488 ms.
Product exploration explored 100000 steps with 33333 reset in 2381 ms.
[2021-05-15 18:30:21] [INFO ] Flatten gal took : 30 ms
[2021-05-15 18:30:21] [INFO ] Flatten gal took : 30 ms
[2021-05-15 18:30:21] [INFO ] Time to serialize gal into /tmp/LTL11268231771217002984.gal : 5 ms
[2021-05-15 18:30:21] [INFO ] Time to serialize properties into /tmp/LTL3642811890032670923.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11268231771217002984.gal, -t, CGAL, -LTL, /tmp/LTL3642811890032670923.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/LTL11268231771217002984.gal -t CGAL -LTL /tmp/LTL3642811890032670923.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((("(p717==1)")||(F("((p376==0)||(p737==1))")))||(G("(p775==1)"))))))
Formula 0 simplified : !XX("(p717==1)" | F"((p376==0)||(p737==1))" | G"(p775==1)")
Detected timeout of ITS tools.
[2021-05-15 18:30:37] [INFO ] Flatten gal took : 29 ms
[2021-05-15 18:30:37] [INFO ] Applying decomposition
[2021-05-15 18:30:37] [INFO ] Flatten gal took : 29 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/graph17523394939053069206.txt, -o, /tmp/graph17523394939053069206.bin, -w, /tmp/graph17523394939053069206.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/graph17523394939053069206.bin, -l, -1, -v, -w, /tmp/graph17523394939053069206.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:30:37] [INFO ] Decomposing Gal with order
[2021-05-15 18:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:30:37] [INFO ] Removed a total of 203 redundant transitions.
[2021-05-15 18:30:37] [INFO ] Flatten gal took : 59 ms
[2021-05-15 18:30:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 18:30:37] [INFO ] Time to serialize gal into /tmp/LTL7266375734006953000.gal : 8 ms
[2021-05-15 18:30:37] [INFO ] Time to serialize properties into /tmp/LTL3846821329263779491.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/LTL7266375734006953000.gal, -t, CGAL, -LTL, /tmp/LTL3846821329263779491.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/LTL7266375734006953000.gal -t CGAL -LTL /tmp/LTL3846821329263779491.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((("(i10.i0.u228.p717==1)")||(F("((i5.i1.u122.p376==0)||(i10.i3.u237.p737==1))")))||(G("(i10.i6.u247.p775==1)"))))))
Formula 0 simplified : !XX("(i10.i0.u228.p717==1)" | F"((i5.i1.u122.p376==0)||(i10.i3.u237.p737==1))" | G"(i10.i6.u247.p775==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11724441380589445886
[2021-05-15 18:30:52] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11724441380589445886
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/ltsmin11724441380589445886]
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/ltsmin11724441380589445886] 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/ltsmin11724441380589445886] 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)
Treatment of property ShieldIIPt-PT-020B-02 finished in 41371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1193 transition count 855
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 955 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 954 transition count 854
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 478 place count 954 transition count 700
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 786 place count 800 transition count 700
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 795 place count 791 transition count 691
Iterating global reduction 3 with 9 rules applied. Total rules applied 804 place count 791 transition count 691
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 804 place count 791 transition count 685
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 816 place count 785 transition count 685
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1486 place count 450 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1487 place count 450 transition count 349
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 4 with 2 rules applied. Total rules applied 1489 place count 449 transition count 348
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1607 place count 390 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1608 place count 389 transition count 386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1610 place count 387 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1610 place count 387 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1612 place count 386 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1613 place count 385 transition count 384
Applied a total of 1613 rules in 566 ms. Remains 385 /1194 variables (removed 809) and now considering 384/1094 (removed 710) transitions.
// Phase 1: matrix 384 rows 385 cols
[2021-05-15 18:30:53] [INFO ] Computed 179 place invariants in 1 ms
[2021-05-15 18:30:54] [INFO ] Implicit Places using invariants in 191 ms returned [374]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
[2021-05-15 18:30:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 384 rows 384 cols
[2021-05-15 18:30:54] [INFO ] Computed 178 place invariants in 5 ms
[2021-05-15 18:30:54] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Starting structural reductions, iteration 1 : 384/1194 places, 384/1094 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 383 transition count 383
Applied a total of 2 rules in 12 ms. Remains 383 /384 variables (removed 1) and now considering 383/384 (removed 1) transitions.
// Phase 1: matrix 383 rows 383 cols
[2021-05-15 18:30:54] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:30:54] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 383 rows 383 cols
[2021-05-15 18:30:54] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:30:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-15 18:30:54] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 383/1194 places, 383/1094 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-03 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:(OR (EQ s354 0) (EQ s272 1) (AND (OR (EQ s20 0) (EQ s112 1)) (OR (EQ s61 0) (EQ s180 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]]
Stuttering criterion allowed to conclude after 197 steps with 1 reset in 2 ms.
FORMULA ShieldIIPt-PT-020B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-03 finished in 1639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1183 transition count 1083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1183 transition count 1083
Applied a total of 22 rules in 77 ms. Remains 1183 /1194 variables (removed 11) and now considering 1083/1094 (removed 11) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:30:55] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:55] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:30:55] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:56] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:30:56] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:30:56] [INFO ] Dead Transitions using invariants and state equation in 535 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1183/1194 places, 1083/1094 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-020B-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s197 0) (EQ s586 1)), p0:(OR (EQ s431 0) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 155 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-04 finished in 1831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1193 transition count 852
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 952 transition count 852
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 482 place count 952 transition count 699
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 788 place count 799 transition count 699
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 796 place count 791 transition count 691
Iterating global reduction 2 with 8 rules applied. Total rules applied 804 place count 791 transition count 691
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 804 place count 791 transition count 685
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 816 place count 785 transition count 685
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1490 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 448 transition count 347
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 1493 place count 447 transition count 346
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
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 1611 place count 388 transition count 385
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1612 place count 388 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1613 place count 387 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 385 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 385 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 384 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1618 place count 383 transition count 382
Applied a total of 1618 rules in 130 ms. Remains 383 /1194 variables (removed 811) and now considering 382/1094 (removed 712) transitions.
// Phase 1: matrix 382 rows 383 cols
[2021-05-15 18:30:56] [INFO ] Computed 179 place invariants in 0 ms
[2021-05-15 18:30:57] [INFO ] Implicit Places using invariants in 174 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
[2021-05-15 18:30:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 382 rows 382 cols
[2021-05-15 18:30:57] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:30:57] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 382/1194 places, 382/1094 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 381
Applied a total of 2 rules in 23 ms. Remains 381 /382 variables (removed 1) and now considering 381/382 (removed 1) transitions.
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:30:57] [INFO ] Computed 178 place invariants in 5 ms
[2021-05-15 18:30:57] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:30:57] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:30:57] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 381/1194 places, 381/1094 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s84 0) (NEQ s3 1) (NEQ s72 0) (NEQ s192 1)), p0:(AND (NEQ s72 0) (NEQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-05 finished in 1092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G((X(p1)&&p0))||X(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1182 transition count 1082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1182 transition count 1082
Applied a total of 24 rules in 98 ms. Remains 1182 /1194 variables (removed 12) and now considering 1082/1094 (removed 12) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:30:58] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:58] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:30:58] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:59] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:30:59] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:30:59] [INFO ] Dead Transitions using invariants and state equation in 524 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1182/1194 places, 1082/1094 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-020B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s747 0) (NEQ s639 1)), p2:(NEQ s325 1), p1:(AND (NEQ s538 0) (NEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29028 steps with 0 reset in 147 ms.
FORMULA ShieldIIPt-PT-020B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-06 finished in 1944 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1193 transition count 854
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 954 transition count 852
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 952 transition count 852
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 482 place count 952 transition count 698
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 790 place count 798 transition count 698
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 798 place count 790 transition count 690
Iterating global reduction 3 with 8 rules applied. Total rules applied 806 place count 790 transition count 690
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 806 place count 790 transition count 683
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 820 place count 783 transition count 683
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1490 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1491 place count 448 transition count 347
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 4 with 2 rules applied. Total rules applied 1493 place count 447 transition count 346
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1611 place count 388 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1612 place count 387 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1614 place count 385 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1614 place count 385 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1616 place count 384 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1617 place count 383 transition count 382
Applied a total of 1617 rules in 121 ms. Remains 383 /1194 variables (removed 811) and now considering 382/1094 (removed 712) transitions.
// Phase 1: matrix 382 rows 383 cols
[2021-05-15 18:30:59] [INFO ] Computed 179 place invariants in 1 ms
[2021-05-15 18:31:00] [INFO ] Implicit Places using invariants in 226 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
[2021-05-15 18:31:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 382 rows 382 cols
[2021-05-15 18:31:00] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:00] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Starting structural reductions, iteration 1 : 382/1194 places, 382/1094 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 381
Applied a total of 2 rules in 10 ms. Remains 381 /382 variables (removed 1) and now considering 381/382 (removed 1) transitions.
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:31:00] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:00] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 381 rows 381 cols
[2021-05-15 18:31:00] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-15 18:31:00] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 381/1194 places, 381/1094 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s110 0) (NEQ s115 1) (OR (EQ s155 0) (EQ s155 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-07 finished in 1137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1181 transition count 1081
Applied a total of 26 rules in 77 ms. Remains 1181 /1194 variables (removed 13) and now considering 1081/1094 (removed 13) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:01] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:01] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:01] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:02] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:02] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:02] [INFO ] Dead Transitions using invariants and state equation in 514 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1194 places, 1081/1094 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s610 0) (EQ s178 1)), p0:(AND (EQ s610 0) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 237 reset in 411 ms.
Product exploration explored 100000 steps with 240 reset in 467 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 238 reset in 388 ms.
Product exploration explored 100000 steps with 240 reset in 440 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 1181 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1181 transition count 1081
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 239 place count 1181 transition count 1204
Deduced a syphon composed of 339 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 339 place count 1181 transition count 1204
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 718 places in 0 ms
Iterating global reduction 1 with 379 rules applied. Total rules applied 718 place count 1181 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1181 transition count 1204
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 2 with 141 rule applications. Total rules 860 place count 1040 transition count 1062
Deduced a syphon composed of 577 places in 1 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 1001 place count 1040 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1002 place count 1040 transition count 1062
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1004 place count 1038 transition count 1060
Deduced a syphon composed of 576 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1006 place count 1038 transition count 1060
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -315
Deduced a syphon composed of 634 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 1064 place count 1038 transition count 1375
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 1122 place count 980 transition count 1259
Deduced a syphon composed of 576 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 1180 place count 980 transition count 1259
Deduced a syphon composed of 576 places in 1 ms
Applied a total of 1180 rules in 267 ms. Remains 980 /1181 variables (removed 201) and now considering 1259/1081 (removed -178) transitions.
[2021-05-15 18:31:05] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1259 rows 980 cols
[2021-05-15 18:31:05] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:31:05] [INFO ] Dead Transitions using invariants and state equation in 675 ms returned []
Finished structural reductions, in 1 iterations. Remains : 980/1181 places, 1259/1081 transitions.
Product exploration explored 100000 steps with 10882 reset in 1534 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 5 in 1 ms.
FORMULA ShieldIIPt-PT-020B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-09 finished in 6315 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1193 transition count 852
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 952 transition count 852
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 482 place count 952 transition count 699
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 788 place count 799 transition count 699
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 797 place count 790 transition count 690
Iterating global reduction 2 with 9 rules applied. Total rules applied 806 place count 790 transition count 690
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 806 place count 790 transition count 683
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 820 place count 783 transition count 683
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1496 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1497 place count 445 transition count 344
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 1499 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
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 1615 place count 386 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1616 place count 385 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1618 place count 383 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1618 place count 383 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1620 place count 382 transition count 379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1621 place count 381 transition count 378
Applied a total of 1621 rules in 105 ms. Remains 381 /1194 variables (removed 813) and now considering 378/1094 (removed 716) transitions.
// Phase 1: matrix 378 rows 381 cols
[2021-05-15 18:31:07] [INFO ] Computed 179 place invariants in 0 ms
[2021-05-15 18:31:07] [INFO ] Implicit Places using invariants in 189 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
[2021-05-15 18:31:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 378 rows 380 cols
[2021-05-15 18:31:07] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:07] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 380/1194 places, 378/1094 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 377
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 379 cols
[2021-05-15 18:31:07] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:31:07] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 377 rows 379 cols
[2021-05-15 18:31:07] [INFO ] Computed 178 place invariants in 0 ms
[2021-05-15 18:31:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-15 18:31:08] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 379/1194 places, 377/1094 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-10 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 s185 0) (EQ s341 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16605 steps with 0 reset in 82 ms.
FORMULA ShieldIIPt-PT-020B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-10 finished in 1100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1181 transition count 1081
Applied a total of 26 rules in 76 ms. Remains 1181 /1194 variables (removed 13) and now considering 1081/1094 (removed 13) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:08] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:08] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:08] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:09] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2021-05-15 18:31:09] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:10] [INFO ] Dead Transitions using invariants and state equation in 523 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1181/1194 places, 1081/1094 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s605 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 717 reset in 264 ms.
Product exploration explored 100000 steps with 709 reset in 301 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 713 reset in 293 ms.
Product exploration explored 100000 steps with 706 reset in 299 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1181 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1181 transition count 1081
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 238 place count 1181 transition count 1204
Deduced a syphon composed of 340 places in 1 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 340 place count 1181 transition count 1204
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 718 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 718 place count 1181 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1181 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Discarding 139 places :
Symmetric choice reduction at 2 with 139 rule applications. Total rules 858 place count 1042 transition count 1064
Deduced a syphon composed of 579 places in 0 ms
Iterating global reduction 2 with 139 rules applied. Total rules applied 997 place count 1042 transition count 1064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 580 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 998 place count 1042 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1000 place count 1040 transition count 1062
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1002 place count 1040 transition count 1062
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -317
Deduced a syphon composed of 637 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1061 place count 1040 transition count 1379
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 1120 place count 981 transition count 1261
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1179 place count 981 transition count 1261
Deduced a syphon composed of 578 places in 1 ms
Applied a total of 1179 rules in 261 ms. Remains 981 /1181 variables (removed 200) and now considering 1261/1081 (removed -180) transitions.
[2021-05-15 18:31:11] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1261 rows 981 cols
[2021-05-15 18:31:11] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:31:12] [INFO ] Dead Transitions using invariants and state equation in 536 ms returned []
Finished structural reductions, in 1 iterations. Remains : 981/1181 places, 1261/1081 transitions.
Product exploration explored 100000 steps with 11175 reset in 1478 ms.
Stack based approach found an accepted trace after 69 steps with 8 reset with depth 5 and stack size 3 in 1 ms.
FORMULA ShieldIIPt-PT-020B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-11 finished in 5391 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1182 transition count 1082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1182 transition count 1082
Applied a total of 24 rules in 75 ms. Remains 1182 /1194 variables (removed 12) and now considering 1082/1094 (removed 12) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:13] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:14] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:14] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:14] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:14] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:15] [INFO ] Dead Transitions using invariants and state equation in 517 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1182/1194 places, 1082/1094 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s950 1), p1:(OR (EQ s511 0) (EQ s703 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 502 ms.
Product exploration explored 100000 steps with 33333 reset in 443 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 438 ms.
Product exploration explored 100000 steps with 33333 reset in 447 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 1182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1182 transition count 1082
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 237 place count 1182 transition count 1206
Deduced a syphon composed of 339 places in 1 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 339 place count 1182 transition count 1206
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 717 places in 1 ms
Iterating global reduction 1 with 378 rules applied. Total rules applied 717 place count 1182 transition count 1207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 718 place count 1182 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Discarding 137 places :
Symmetric choice reduction at 2 with 137 rule applications. Total rules 855 place count 1045 transition count 1069
Deduced a syphon composed of 580 places in 1 ms
Iterating global reduction 2 with 137 rules applied. Total rules applied 992 place count 1045 transition count 1069
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 1045 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 995 place count 1043 transition count 1067
Deduced a syphon composed of 579 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 997 place count 1043 transition count 1067
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -316
Deduced a syphon composed of 638 places in 1 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 1056 place count 1043 transition count 1383
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 1116 place count 983 transition count 1263
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 1176 place count 983 transition count 1263
Deduced a syphon composed of 578 places in 0 ms
Applied a total of 1176 rules in 247 ms. Remains 983 /1182 variables (removed 199) and now considering 1263/1082 (removed -181) transitions.
[2021-05-15 18:31:18] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1263 rows 983 cols
[2021-05-15 18:31:18] [INFO ] Computed 181 place invariants in 5 ms
[2021-05-15 18:31:18] [INFO ] Dead Transitions using invariants and state equation in 540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 983/1182 places, 1263/1082 transitions.
Product exploration explored 100000 steps with 33333 reset in 1463 ms.
Product exploration explored 100000 steps with 33333 reset in 1448 ms.
[2021-05-15 18:31:21] [INFO ] Flatten gal took : 28 ms
[2021-05-15 18:31:21] [INFO ] Flatten gal took : 45 ms
[2021-05-15 18:31:21] [INFO ] Time to serialize gal into /tmp/LTL18124744919973573738.gal : 3 ms
[2021-05-15 18:31:21] [INFO ] Time to serialize properties into /tmp/LTL311775746988236870.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/LTL18124744919973573738.gal, -t, CGAL, -LTL, /tmp/LTL311775746988236870.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/LTL18124744919973573738.gal -t CGAL -LTL /tmp/LTL311775746988236870.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p1123==1)"))U(X(X("((p599==0)||(p829==1))")))))
Formula 0 simplified : !(F"(p1123==1)" U XX"((p599==0)||(p829==1))")
Detected timeout of ITS tools.
[2021-05-15 18:31:36] [INFO ] Flatten gal took : 28 ms
[2021-05-15 18:31:36] [INFO ] Applying decomposition
[2021-05-15 18:31:37] [INFO ] Flatten gal took : 28 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/graph12944123188995695448.txt, -o, /tmp/graph12944123188995695448.bin, -w, /tmp/graph12944123188995695448.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/graph12944123188995695448.bin, -l, -1, -v, -w, /tmp/graph12944123188995695448.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:31:37] [INFO ] Decomposing Gal with order
[2021-05-15 18:31:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:31:37] [INFO ] Removed a total of 201 redundant transitions.
[2021-05-15 18:31:37] [INFO ] Flatten gal took : 55 ms
[2021-05-15 18:31:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 18:31:37] [INFO ] Time to serialize gal into /tmp/LTL9924455043629951181.gal : 7 ms
[2021-05-15 18:31:37] [INFO ] Time to serialize properties into /tmp/LTL9069616780574223845.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/LTL9924455043629951181.gal, -t, CGAL, -LTL, /tmp/LTL9069616780574223845.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/LTL9924455043629951181.gal -t CGAL -LTL /tmp/LTL9069616780574223845.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i16.u352.p1123==1)"))U(X(X("((i8.u192.p599==0)||(i12.u263.p829==1))")))))
Formula 0 simplified : !(F"(i16.u352.p1123==1)" U XX"((i8.u192.p599==0)||(i12.u263.p829==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8103610617618487902
[2021-05-15 18:31:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8103610617618487902
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/ltsmin8103610617618487902]
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/ltsmin8103610617618487902] 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/ltsmin8103610617618487902] 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)
Treatment of property ShieldIIPt-PT-020B-12 finished in 39465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((X(X((F(p2)&&p1)))||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1183 transition count 1083
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1183 transition count 1083
Applied a total of 22 rules in 78 ms. Remains 1183 /1194 variables (removed 11) and now considering 1083/1094 (removed 11) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:31:53] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:53] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:31:53] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:54] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
// Phase 1: matrix 1083 rows 1183 cols
[2021-05-15 18:31:54] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:55] [INFO ] Dead Transitions using invariants and state equation in 622 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1183/1194 places, 1083/1094 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (NEQ s464 0) (NEQ s532 1)), p1:(AND (NEQ s243 0) (NEQ s1121 1)), p2:(AND (NEQ s243 0) (NEQ s1121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8663 steps with 0 reset in 36 ms.
FORMULA ShieldIIPt-PT-020B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-13 finished in 2084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0||G(p1)))&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1182 transition count 1082
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1182 transition count 1082
Applied a total of 24 rules in 94 ms. Remains 1182 /1194 variables (removed 12) and now considering 1082/1094 (removed 12) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:55] [INFO ] Computed 181 place invariants in 2 ms
[2021-05-15 18:31:55] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:55] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:56] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2021-05-15 18:31:56] [INFO ] Computed 181 place invariants in 3 ms
[2021-05-15 18:31:57] [INFO ] Dead Transitions using invariants and state equation in 591 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1182/1194 places, 1082/1094 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s90 1), p1:(AND (NEQ s768 0) (NEQ s532 1)), p2:(OR (NEQ s532 0) (NEQ s768 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 426 ms.
Product exploration explored 100000 steps with 1 reset in 589 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 614 ms.
[2021-05-15 18:32:00] [INFO ] Flatten gal took : 27 ms
[2021-05-15 18:32:00] [INFO ] Flatten gal took : 27 ms
[2021-05-15 18:32:00] [INFO ] Time to serialize gal into /tmp/LTL3602130770787856236.gal : 3 ms
[2021-05-15 18:32:00] [INFO ] Time to serialize properties into /tmp/LTL14948947831582616578.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/LTL3602130770787856236.gal, -t, CGAL, -LTL, /tmp/LTL14948947831582616578.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/LTL3602130770787856236.gal -t CGAL -LTL /tmp/LTL14948947831582616578.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(("(p101!=1)")||(G("((p907!=0)&&(p626!=1))"))))&&(X("((p626!=0)||(p907!=1))")))))
Formula 0 simplified : !F(G("(p101!=1)" | G"((p907!=0)&&(p626!=1))") & X"((p626!=0)||(p907!=1))")
Detected timeout of ITS tools.
[2021-05-15 18:32:15] [INFO ] Flatten gal took : 26 ms
[2021-05-15 18:32:15] [INFO ] Applying decomposition
[2021-05-15 18:32:15] [INFO ] Flatten gal took : 26 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/graph4035113949756940222.txt, -o, /tmp/graph4035113949756940222.bin, -w, /tmp/graph4035113949756940222.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/graph4035113949756940222.bin, -l, -1, -v, -w, /tmp/graph4035113949756940222.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:32:15] [INFO ] Decomposing Gal with order
[2021-05-15 18:32:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:32:15] [INFO ] Removed a total of 200 redundant transitions.
[2021-05-15 18:32:15] [INFO ] Flatten gal took : 73 ms
[2021-05-15 18:32:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 18:32:15] [INFO ] Time to serialize gal into /tmp/LTL13171742651109415658.gal : 15 ms
[2021-05-15 18:32:15] [INFO ] Time to serialize properties into /tmp/LTL6861112323373260822.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/LTL13171742651109415658.gal, -t, CGAL, -LTL, /tmp/LTL6861112323373260822.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/LTL13171742651109415658.gal -t CGAL -LTL /tmp/LTL6861112323373260822.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(("(i1.u34.p101!=1)")||(G("((i12.u287.p907!=0)&&(i8.u199.p626!=1))"))))&&(X("((i8.u199.p626!=0)||(i12.u287.p907!=1))")))))
Formula 0 simplified : !F(G("(i1.u34.p101!=1)" | G"((i12.u287.p907!=0)&&(i8.u199.p626!=1))") & X"((i8.u199.p626!=0)||(i12.u287.p907!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1129169306523090078
[2021-05-15 18:32:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1129169306523090078
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/ltsmin1129169306523090078]
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/ltsmin1129169306523090078] 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/ltsmin1129169306523090078] 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)
Treatment of property ShieldIIPt-PT-020B-14 finished in 36384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1194 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1194/1194 places, 1094/1094 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1193 transition count 851
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 951 transition count 851
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 484 place count 951 transition count 698
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 790 place count 798 transition count 698
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 798 place count 790 transition count 690
Iterating global reduction 2 with 8 rules applied. Total rules applied 806 place count 790 transition count 690
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 806 place count 790 transition count 684
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 818 place count 784 transition count 684
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1498 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1499 place count 444 transition count 343
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 1501 place count 443 transition count 342
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1619 place count 384 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1620 place count 383 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1622 place count 381 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1622 place count 381 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1624 place count 380 transition count 379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1625 place count 379 transition count 378
Applied a total of 1625 rules in 114 ms. Remains 379 /1194 variables (removed 815) and now considering 378/1094 (removed 716) transitions.
// Phase 1: matrix 378 rows 379 cols
[2021-05-15 18:32:31] [INFO ] Computed 179 place invariants in 0 ms
[2021-05-15 18:32:32] [INFO ] Implicit Places using invariants in 187 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
[2021-05-15 18:32:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 378 rows 378 cols
[2021-05-15 18:32:32] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:32] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Starting structural reductions, iteration 1 : 378/1194 places, 378/1094 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 377
Applied a total of 2 rules in 9 ms. Remains 377 /378 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 377 cols
[2021-05-15 18:32:32] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:32] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 377 rows 377 cols
[2021-05-15 18:32:32] [INFO ] Computed 178 place invariants in 1 ms
[2021-05-15 18:32:32] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 377/1194 places, 377/1094 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-15 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}]], initial=1, aps=[p0:(OR (EQ s24 0) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 70370 steps with 0 reset in 318 ms.
FORMULA ShieldIIPt-PT-020B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-15 finished in 1384 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10267429983532974056
[2021-05-15 18:32:33] [INFO ] Computing symmetric may disable matrix : 1094 transitions.
[2021-05-15 18:32:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:32:33] [INFO ] Computing symmetric may enable matrix : 1094 transitions.
[2021-05-15 18:32:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:32:33] [INFO ] Applying decomposition
[2021-05-15 18:32:33] [INFO ] Flatten gal took : 65 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/graph5055238315102689248.txt, -o, /tmp/graph5055238315102689248.bin, -w, /tmp/graph5055238315102689248.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/graph5055238315102689248.bin, -l, -1, -v, -w, /tmp/graph5055238315102689248.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 18:32:33] [INFO ] Decomposing Gal with order
[2021-05-15 18:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:32:33] [INFO ] Computing Do-Not-Accords matrix : 1094 transitions.
[2021-05-15 18:32:33] [INFO ] Computation of Completed DNA matrix. took 88 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 18:32:33] [INFO ] Built C files in 492ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10267429983532974056
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/ltsmin10267429983532974056]
[2021-05-15 18:32:33] [INFO ] Removed a total of 192 redundant transitions.
[2021-05-15 18:32:33] [INFO ] Flatten gal took : 193 ms
[2021-05-15 18:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 18:32:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality15545786645582823751.gal : 20 ms
[2021-05-15 18:32:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality9679028797390050550.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality15545786645582823751.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9679028797390050550.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/LTLCardinality15545786645582823751.gal -t CGAL -LTL /tmp/LTLCardinality9679028797390050550.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X((G(("((i0.i4.u20.p49==0)&&(i15.i5.u347.p1097==1))")||(G(!("((i15.i5.u347.p1097==0)||(i0.i4.u20.p49==1))")))))U(("((i8.i5.u200.p630==0)||(i0.i6.u29.p72==1))")&&(X("(i12.i3.u278.p882!=1)"))))))
Formula 0 simplified : !X(G("((i0.i4.u20.p49==0)&&(i15.i5.u347.p1097==1))" | G!"((i15.i5.u347.p1097==0)||(i0.i4.u20.p49==1))") U ("((i8.i5.u200.p630==0)||(i0.i6.u29.p72==1))" & X"(i12.i3.u278.p882!=1)"))
Compilation finished in 9523 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10267429983532974056]
Link finished in 81 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](((LTLAPp0==true)||[]((LTLAPp1==true)))) U ((LTLAPp2==true)&&X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
LTSmin run took 429 ms.
FORMULA ShieldIIPt-PT-020B-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp4==true)||<>((LTLAPp5==true))||[]((LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
LTSmin run took 984 ms.
FORMULA ShieldIIPt-PT-020B-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp7==true)) U X(X((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
LTSmin run took 1052 ms.
FORMULA ShieldIIPt-PT-020B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](((LTLAPp9==true)||[]((LTLAPp10==true))))&&X((LTLAPp11==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.507: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.507: LTL layer: formula: <>(([](((LTLAPp9==true)||[]((LTLAPp10==true))))&&X((LTLAPp11==true))))
pins2lts-mc-linux64( 1/ 8), 0.513: "<>(([](((LTLAPp9==true)||[]((LTLAPp10==true))))&&X((LTLAPp11==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.523: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.545: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.531: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.539: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.560: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.563: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.551: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.556: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 5.005: There are 1107 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.006: State length is 1195, there are 1122 groups
pins2lts-mc-linux64( 0/ 8), 5.006: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.006: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.006: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 5.006: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 5.196: [Blue] ~120 levels ~960 states ~15552 transitions
pins2lts-mc-linux64( 4/ 8), 5.242: [Blue] ~240 levels ~1920 states ~29296 transitions
pins2lts-mc-linux64( 4/ 8), 5.320: [Blue] ~480 levels ~3840 states ~61328 transitions
pins2lts-mc-linux64( 6/ 8), 5.470: [Blue] ~960 levels ~7680 states ~76544 transitions
pins2lts-mc-linux64( 6/ 8), 5.712: [Blue] ~1920 levels ~15360 states ~121912 transitions
pins2lts-mc-linux64( 6/ 8), 6.228: [Blue] ~3837 levels ~30720 states ~200352 transitions
pins2lts-mc-linux64( 6/ 8), 7.326: [Blue] ~7677 levels ~61440 states ~352384 transitions
pins2lts-mc-linux64( 6/ 8), 9.360: [Blue] ~15320 levels ~122880 states ~665880 transitions
pins2lts-mc-linux64( 6/ 8), 14.103: [Blue] ~30633 levels ~245760 states ~1494920 transitions
pins2lts-mc-linux64( 2/ 8), 22.860: [Blue] ~59945 levels ~491520 states ~2891680 transitions
pins2lts-mc-linux64( 3/ 8), 40.470: [Blue] ~122571 levels ~983040 states ~5251264 transitions
pins2lts-mc-linux64( 4/ 8), 77.489: [Blue] ~243742 levels ~1966080 states ~11537768 transitions
pins2lts-mc-linux64( 3/ 8), 150.988: [Blue] ~490537 levels ~3932160 states ~22711000 transitions
pins2lts-mc-linux64( 4/ 8), 196.031: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 196.192:
pins2lts-mc-linux64( 0/ 8), 196.192: Explored 4837661 states 29757477 transitions, fanout: 6.151
pins2lts-mc-linux64( 0/ 8), 196.192: Total exploration time 191.170 sec (191.040 sec minimum, 191.104 sec on average)
pins2lts-mc-linux64( 0/ 8), 196.192: States per second: 25306, Transitions per second: 155660
pins2lts-mc-linux64( 0/ 8), 196.192:
pins2lts-mc-linux64( 0/ 8), 196.192: State space has 16698411 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 196.192: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 196.192: blue states: 4837661 (28.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 196.192: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 196.192: all-red states: 1 (0.00%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 196.192:
pins2lts-mc-linux64( 0/ 8), 196.192: Total memory used for local state coloring: 66.5MB
pins2lts-mc-linux64( 0/ 8), 196.192:
pins2lts-mc-linux64( 0/ 8), 196.192: Queue width: 8B, total height: 4358484, memory: 33.25MB
pins2lts-mc-linux64( 0/ 8), 196.192: Tree memory: 383.4MB, 24.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 196.192: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 196.192: Stored 1148 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 196.192: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 196.192: Est. total memory use: 416.7MB (~1057.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](((LTLAPp9==true)||[]((LTLAPp10==true))))&&X((LTLAPp11==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](((LTLAPp9==true)||[]((LTLAPp10==true))))&&X((LTLAPp11==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin10267429983532974056]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 18:54:25] [INFO ] Applying decomposition
[2021-05-15 18:54:25] [INFO ] Flatten gal took : 27 ms
[2021-05-15 18:54:25] [INFO ] Decomposing Gal with order
[2021-05-15 18:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:54:25] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-15 18:54:25] [INFO ] Flatten gal took : 42 ms
[2021-05-15 18:54:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 18:54:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality17450035603960236624.gal : 9 ms
[2021-05-15 18:54:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality2727991597289053925.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality17450035603960236624.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2727991597289053925.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/LTLCardinality17450035603960236624.gal -t CGAL -LTL /tmp/LTLCardinality2727991597289053925.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u45.p101!=1)")||(G(!("((i0.i0.i0.i0.i0.i0.i0.i1.i0.u240.p907==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.p626==1))")))))&&(X(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.p626==0)&&(i0.i0.i0.i0.i0.i0.i0.i1.i0.u240.p907==1))"))))))
Formula 0 simplified : !F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u45.p101!=1)" | G!"((i0.i0.i0.i0.i0.i0.i0.i1.i0.u240.p907==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.p626==1))") & X!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u172.p626==0)&&(i0.i0.i0.i0.i0.i0.i0.i1.i0.u240.p907==1))")
Detected timeout of ITS tools.
[2021-05-15 19:16:28] [INFO ] Flatten gal took : 132 ms
[2021-05-15 19:16:29] [INFO ] Input system was already deterministic with 1094 transitions.
[2021-05-15 19:16:29] [INFO ] Transformed 1194 places.
[2021-05-15 19:16:29] [INFO ] Transformed 1094 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 19:16:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality12642545965438478287.gal : 9 ms
[2021-05-15 19:16:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality6165712532725015473.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality12642545965438478287.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6165712532725015473.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality12642545965438478287.gal -t CGAL -LTL /tmp/LTLCardinality6165712532725015473.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(("(p101!=1)")||(G(!("((p907==0)||(p626==1))")))))&&(X(!("((p626==0)&&(p907==1))"))))))
Formula 0 simplified : !F(G("(p101!=1)" | G!"((p907==0)||(p626==1))") & X!"((p626==0)&&(p907==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldIIPt-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 ShieldIIPt-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-162098205100444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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