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-162098205100460.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-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205100460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 512K 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-030B-00
FORMULA_NAME ShieldIIPt-PT-030B-01
FORMULA_NAME ShieldIIPt-PT-030B-02
FORMULA_NAME ShieldIIPt-PT-030B-03
FORMULA_NAME ShieldIIPt-PT-030B-04
FORMULA_NAME ShieldIIPt-PT-030B-05
FORMULA_NAME ShieldIIPt-PT-030B-06
FORMULA_NAME ShieldIIPt-PT-030B-07
FORMULA_NAME ShieldIIPt-PT-030B-08
FORMULA_NAME ShieldIIPt-PT-030B-09
FORMULA_NAME ShieldIIPt-PT-030B-10
FORMULA_NAME ShieldIIPt-PT-030B-11
FORMULA_NAME ShieldIIPt-PT-030B-12
FORMULA_NAME ShieldIIPt-PT-030B-13
FORMULA_NAME ShieldIIPt-PT-030B-14
FORMULA_NAME ShieldIIPt-PT-030B-15

=== Now, execution of the tool begins

BK_START 1621106892109

Running Version 0
[2021-05-15 19:28:34] [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 19:28:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 19:28:34] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2021-05-15 19:28:34] [INFO ] Transformed 2103 places.
[2021-05-15 19:28:34] [INFO ] Transformed 1953 transitions.
[2021-05-15 19:28:34] [INFO ] Found NUPN structural information;
[2021-05-15 19:28:34] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 19:28:34] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldIIPt-PT-030B-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 1780 transition count 1630
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 1780 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 1779 transition count 1629
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 1779 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1778 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1778 transition count 1628
Applied a total of 650 rules in 901 ms. Remains 1778 /2103 variables (removed 325) and now considering 1628/1953 (removed 325) transitions.
// Phase 1: matrix 1628 rows 1778 cols
[2021-05-15 19:28:35] [INFO ] Computed 271 place invariants in 24 ms
[2021-05-15 19:28:36] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 1628 rows 1778 cols
[2021-05-15 19:28:36] [INFO ] Computed 271 place invariants in 9 ms
[2021-05-15 19:28:37] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
// Phase 1: matrix 1628 rows 1778 cols
[2021-05-15 19:28:37] [INFO ] Computed 271 place invariants in 7 ms
[2021-05-15 19:28:38] [INFO ] Dead Transitions using invariants and state equation in 847 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1778/2103 places, 1628/1953 transitions.
[2021-05-15 19:28:38] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 19:28:38] [INFO ] Flatten gal took : 152 ms
FORMULA ShieldIIPt-PT-030B-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 19:28:38] [INFO ] Flatten gal took : 77 ms
[2021-05-15 19:28:39] [INFO ] Input system was already deterministic with 1628 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 793 ms. (steps per millisecond=126 ) properties (out of 14) seen :10
Running SMT prover for 4 properties.
// Phase 1: matrix 1628 rows 1778 cols
[2021-05-15 19:29:03] [INFO ] Computed 271 place invariants in 5 ms
[2021-05-15 19:29:03] [INFO ] [Real]Absence check using 271 positive place invariants in 79 ms returned sat
[2021-05-15 19:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:29:03] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2021-05-15 19:29:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:29:04] [INFO ] [Nat]Absence check using 271 positive place invariants in 97 ms returned sat
[2021-05-15 19:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:29:05] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2021-05-15 19:29:05] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 4 ms to minimize.
[2021-05-15 19:29:05] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 2 ms to minimize.
[2021-05-15 19:29:06] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 2 ms to minimize.
[2021-05-15 19:29:06] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 2 ms to minimize.
[2021-05-15 19:29:07] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 1 ms to minimize.
[2021-05-15 19:29:07] [INFO ] Deduced a trap composed of 18 places in 357 ms of which 1 ms to minimize.
[2021-05-15 19:29:07] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 2 ms to minimize.
[2021-05-15 19:29:08] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2021-05-15 19:29:08] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 0 ms to minimize.
[2021-05-15 19:29:09] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 1 ms to minimize.
[2021-05-15 19:29:09] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:29:09] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2021-05-15 19:29:10] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:29:10] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 1 ms to minimize.
[2021-05-15 19:29:10] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 0 ms to minimize.
[2021-05-15 19:29:10] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 0 ms to minimize.
[2021-05-15 19:29:11] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 0 ms to minimize.
[2021-05-15 19:29:11] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 0 ms to minimize.
[2021-05-15 19:29:11] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2021-05-15 19:29:31] [INFO ] Deduced a trap composed of 21 places in 19336 ms of which 0 ms to minimize.
[2021-05-15 19:29:31] [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 19:29:31] [INFO ] [Real]Absence check using 271 positive place invariants in 79 ms returned sat
[2021-05-15 19:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:29:32] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2021-05-15 19:29:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:29:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 75 ms returned sat
[2021-05-15 19:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:29:32] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2021-05-15 19:29:33] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 1 ms to minimize.
[2021-05-15 19:29:33] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 1 ms to minimize.
[2021-05-15 19:29:34] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2021-05-15 19:29:34] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 1 ms to minimize.
[2021-05-15 19:29:34] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2021-05-15 19:29:35] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 1 ms to minimize.
[2021-05-15 19:29:35] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 0 ms to minimize.
[2021-05-15 19:29:35] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 0 ms to minimize.
[2021-05-15 19:29:36] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2021-05-15 19:29:36] [INFO ] Deduced a trap composed of 16 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:29:36] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 1 ms to minimize.
[2021-05-15 19:29:36] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:29:37] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 0 ms to minimize.
[2021-05-15 19:29:37] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:29:37] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2021-05-15 19:29:38] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2021-05-15 19:29:38] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2021-05-15 19:29:38] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 1 ms to minimize.
[2021-05-15 19:29:38] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2021-05-15 19:29:39] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 1 ms to minimize.
[2021-05-15 19:29:39] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 4 ms to minimize.
[2021-05-15 19:29:39] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:29:39] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2021-05-15 19:29:40] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2021-05-15 19:29:40] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:29:40] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 1 ms to minimize.
[2021-05-15 19:29:40] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 1 ms to minimize.
[2021-05-15 19:29:41] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2021-05-15 19:29:41] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 1 ms to minimize.
[2021-05-15 19:29:41] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2021-05-15 19:29:41] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2021-05-15 19:29:41] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2021-05-15 19:29:42] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2021-05-15 19:29:42] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 0 ms to minimize.
[2021-05-15 19:29:42] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2021-05-15 19:29:42] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 7 ms to minimize.
[2021-05-15 19:29:42] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 0 ms to minimize.
[2021-05-15 19:29:43] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2021-05-15 19:29:43] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2021-05-15 19:29:43] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2021-05-15 19:29:43] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:29:43] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10796 ms
[2021-05-15 19:29:43] [INFO ] Computed and/alt/rep : 1627/2441/1627 causal constraints (skipped 0 transitions) in 86 ms.
[2021-05-15 19:30:01] [INFO ] Added : 155 causal constraints over 31 iterations in 17871 ms. Result :unknown
[2021-05-15 19:30:01] [INFO ] [Real]Absence check using 271 positive place invariants in 75 ms returned sat
[2021-05-15 19:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:30:02] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2021-05-15 19:30:02] [INFO ] Deduced a trap composed of 22 places in 308 ms of which 0 ms to minimize.
[2021-05-15 19:30:03] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 1 ms to minimize.
[2021-05-15 19:30:03] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 0 ms to minimize.
[2021-05-15 19:30:03] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 1 ms to minimize.
[2021-05-15 19:30:04] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2021-05-15 19:30:04] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 0 ms to minimize.
[2021-05-15 19:30:04] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2021-05-15 19:30:05] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 1 ms to minimize.
[2021-05-15 19:30:05] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:30:05] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 0 ms to minimize.
[2021-05-15 19:30:06] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 1 ms to minimize.
[2021-05-15 19:30:06] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:30:06] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 0 ms to minimize.
[2021-05-15 19:30:07] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 1 ms to minimize.
[2021-05-15 19:30:07] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:30:07] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 0 ms to minimize.
[2021-05-15 19:30:08] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 1 ms to minimize.
[2021-05-15 19:30:08] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 0 ms to minimize.
[2021-05-15 19:30:08] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2021-05-15 19:30:08] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 1 ms to minimize.
[2021-05-15 19:30:09] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2021-05-15 19:30:09] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 1 ms to minimize.
[2021-05-15 19:30:09] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2021-05-15 19:30:09] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2021-05-15 19:30:10] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2021-05-15 19:30:10] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 1 ms to minimize.
[2021-05-15 19:30:10] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 1 ms to minimize.
[2021-05-15 19:30:10] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2021-05-15 19:30:11] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 1 ms to minimize.
[2021-05-15 19:30:11] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2021-05-15 19:30:11] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2021-05-15 19:30:11] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2021-05-15 19:30:12] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2021-05-15 19:30:12] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2021-05-15 19:30:12] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2021-05-15 19:30:12] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2021-05-15 19:30:12] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2021-05-15 19:30:13] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2021-05-15 19:30:14] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 1 ms to minimize.
[2021-05-15 19:30:14] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2021-05-15 19:30:14] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2021-05-15 19:30:14] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2021-05-15 19:30:14] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2021-05-15 19:30:15] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2021-05-15 19:30:15] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 0 ms to minimize.
[2021-05-15 19:30:15] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 12884 ms
[2021-05-15 19:30:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:30:20] [INFO ] [Real]Absence check using 271 positive place invariants in 73 ms returned sat
[2021-05-15 19:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 19:30:21] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2021-05-15 19:30:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 19:30:21] [INFO ] [Nat]Absence check using 271 positive place invariants in 76 ms returned sat
[2021-05-15 19:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 19:30:22] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2021-05-15 19:30:22] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 0 ms to minimize.
[2021-05-15 19:30:22] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 1 ms to minimize.
[2021-05-15 19:30:23] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2021-05-15 19:30:23] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 1 ms to minimize.
[2021-05-15 19:30:23] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 1 ms to minimize.
[2021-05-15 19:30:24] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 1 ms to minimize.
[2021-05-15 19:30:24] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 0 ms to minimize.
[2021-05-15 19:30:24] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 2 ms to minimize.
[2021-05-15 19:30:25] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2021-05-15 19:30:25] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 1 ms to minimize.
[2021-05-15 19:30:25] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:30:26] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2021-05-15 19:30:26] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 1 ms to minimize.
[2021-05-15 19:30:26] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2021-05-15 19:30:27] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 1 ms to minimize.
[2021-05-15 19:30:27] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 1 ms to minimize.
[2021-05-15 19:30:27] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 1 ms to minimize.
[2021-05-15 19:30:27] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 1 ms to minimize.
[2021-05-15 19:30:28] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2021-05-15 19:30:28] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 0 ms to minimize.
[2021-05-15 19:30:28] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2021-05-15 19:30:29] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 0 ms to minimize.
[2021-05-15 19:30:29] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2021-05-15 19:30:29] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:30:29] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 1 ms to minimize.
[2021-05-15 19:30:30] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 1 ms to minimize.
[2021-05-15 19:30:30] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 0 ms to minimize.
[2021-05-15 19:30:30] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2021-05-15 19:30:31] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2021-05-15 19:30:31] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 0 ms to minimize.
[2021-05-15 19:30:31] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 0 ms to minimize.
[2021-05-15 19:30:31] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2021-05-15 19:30:31] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2021-05-15 19:30:32] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 1 ms to minimize.
[2021-05-15 19:30:32] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2021-05-15 19:30:32] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2021-05-15 19:30:32] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 1 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2021-05-15 19:30:33] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2021-05-15 19:30:34] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 12877 ms
[2021-05-15 19:30:35] [INFO ] Computed and/alt/rep : 1627/2441/1627 causal constraints (skipped 0 transitions) in 84 ms.
[2021-05-15 19:30:41] [INFO ] Deduced a trap composed of 15 places in 703 ms of which 2 ms to minimize.
[2021-05-15 19:30:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1777 transition count 1267
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1417 transition count 1267
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 720 place count 1417 transition count 1029
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1196 place count 1179 transition count 1029
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1202 place count 1173 transition count 1023
Iterating global reduction 2 with 6 rules applied. Total rules applied 1208 place count 1173 transition count 1023
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1208 place count 1173 transition count 1019
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1216 place count 1169 transition count 1019
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 2 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2228 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 place count 663 transition count 512
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 662 transition count 511
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 573 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2410 place count 572 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2412 place count 570 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2412 place count 570 transition count 568
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 2414 place count 569 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2415 place count 568 transition count 567
Applied a total of 2415 rules in 443 ms. Remains 568 /1778 variables (removed 1210) and now considering 567/1628 (removed 1061) transitions.
// Phase 1: matrix 567 rows 568 cols
[2021-05-15 19:30:42] [INFO ] Computed 269 place invariants in 2 ms
[2021-05-15 19:30:42] [INFO ] Implicit Places using invariants in 339 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
[2021-05-15 19:30:42] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2021-05-15 19:30:42] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:30:43] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
Starting structural reductions, iteration 1 : 567/1778 places, 567/1628 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 566 transition count 566
Applied a total of 2 rules in 35 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2021-05-15 19:30:43] [INFO ] Computed 268 place invariants in 2 ms
[2021-05-15 19:30:43] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 566 rows 566 cols
[2021-05-15 19:30:43] [INFO ] Computed 268 place invariants in 2 ms
[2021-05-15 19:30:44] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 566/1778 places, 566/1628 transitions.
Stuttering acceptance computed with spot in 11403 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-01 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 s331 0) (NEQ s410 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 2 ms.
FORMULA ShieldIIPt-PT-030B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-01 finished in 13434 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 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1777 transition count 1269
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 718 place count 1418 transition count 1030
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1194 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1199 place count 1175 transition count 1025
Iterating global reduction 3 with 5 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1204 place count 1175 transition count 1022
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1210 place count 1172 transition count 1022
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
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 2229 place count 663 transition count 512
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2405 place count 575 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2406 place count 574 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2408 place count 572 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2408 place count 572 transition count 566
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 2410 place count 571 transition count 566
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2411 place count 570 transition count 565
Applied a total of 2411 rules in 406 ms. Remains 570 /1778 variables (removed 1208) and now considering 565/1628 (removed 1063) transitions.
// Phase 1: matrix 565 rows 570 cols
[2021-05-15 19:30:55] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:30:56] [INFO ] Implicit Places using invariants in 361 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
[2021-05-15 19:30:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 565 rows 569 cols
[2021-05-15 19:30:56] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:30:56] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Starting structural reductions, iteration 1 : 569/1778 places, 565/1628 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 568 transition count 564
Applied a total of 2 rules in 19 ms. Remains 568 /569 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 568 cols
[2021-05-15 19:30:56] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:30:56] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 564 rows 568 cols
[2021-05-15 19:30:56] [INFO ] Computed 268 place invariants in 7 ms
[2021-05-15 19:30:57] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 568/1778 places, 564/1628 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-03 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 s302 0) (NEQ s288 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-030B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-03 finished in 1922 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1777 transition count 1269
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 718 place count 1418 transition count 1031
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1192 place count 1181 transition count 1031
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1198 place count 1175 transition count 1025
Iterating global reduction 3 with 6 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1204 place count 1175 transition count 1021
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1212 place count 1171 transition count 1021
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
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 4 with 2 rules applied. Total rules applied 2229 place count 663 transition count 512
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2405 place count 575 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2406 place count 574 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2408 place count 572 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2408 place count 572 transition count 568
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 2410 place count 571 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2411 place count 570 transition count 567
Applied a total of 2411 rules in 323 ms. Remains 570 /1778 variables (removed 1208) and now considering 567/1628 (removed 1061) transitions.
// Phase 1: matrix 567 rows 570 cols
[2021-05-15 19:30:57] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:30:58] [INFO ] Implicit Places using invariants in 328 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
[2021-05-15 19:30:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 567 rows 569 cols
[2021-05-15 19:30:58] [INFO ] Computed 268 place invariants in 3 ms
[2021-05-15 19:30:58] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Starting structural reductions, iteration 1 : 569/1778 places, 567/1628 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 568 transition count 566
Applied a total of 2 rules in 19 ms. Remains 568 /569 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 568 cols
[2021-05-15 19:30:58] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:30:58] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 566 rows 568 cols
[2021-05-15 19:30:58] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:30:59] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 568/1778 places, 566/1628 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s473 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-06 finished in 1901 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1777 transition count 1268
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1418 transition count 1268
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 718 place count 1418 transition count 1031
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1192 place count 1181 transition count 1031
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1198 place count 1175 transition count 1025
Iterating global reduction 2 with 6 rules applied. Total rules applied 1204 place count 1175 transition count 1025
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1204 place count 1175 transition count 1021
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1212 place count 1171 transition count 1021
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 1 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 2 with 1008 rules applied. Total rules applied 2220 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 667 transition count 516
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 2223 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2401 place count 577 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2402 place count 576 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2403 place count 575 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2403 place count 575 transition count 572
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2405 place count 574 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2406 place count 573 transition count 571
Applied a total of 2406 rules in 286 ms. Remains 573 /1778 variables (removed 1205) and now considering 571/1628 (removed 1057) transitions.
// Phase 1: matrix 571 rows 573 cols
[2021-05-15 19:30:59] [INFO ] Computed 270 place invariants in 1 ms
[2021-05-15 19:30:59] [INFO ] Implicit Places using invariants in 326 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 327 ms to find 1 implicit places.
[2021-05-15 19:30:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 571 rows 572 cols
[2021-05-15 19:30:59] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:31:00] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Starting structural reductions, iteration 1 : 572/1778 places, 571/1628 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 571 transition count 570
Applied a total of 2 rules in 18 ms. Remains 571 /572 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 571 cols
[2021-05-15 19:31:00] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:31:00] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 570 rows 571 cols
[2021-05-15 19:31:00] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:31:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-15 19:31:01] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 571/1778 places, 570/1628 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut2408015646779814804.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10747 ms :[false, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-07 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 s562 0) (EQ s358 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10202 reset in 745 ms.
Product exploration explored 100000 steps with 10180 reset in 748 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10141 reset in 607 ms.
Product exploration explored 100000 steps with 10213 reset in 719 ms.
[2021-05-15 19:31:14] [INFO ] Flatten gal took : 29 ms
[2021-05-15 19:31:14] [INFO ] Flatten gal took : 27 ms
[2021-05-15 19:31:14] [INFO ] Time to serialize gal into /tmp/LTL8882160506356222802.gal : 17 ms
[2021-05-15 19:31:14] [INFO ] Time to serialize properties into /tmp/LTL6242133640895374824.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/LTL8882160506356222802.gal, -t, CGAL, -LTL, /tmp/LTL6242133640895374824.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/LTL8882160506356222802.gal -t CGAL -LTL /tmp/LTL6242133640895374824.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2055==0)||(p1310==1))"))))
Formula 0 simplified : !GF"((p2055==0)||(p1310==1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t32, t366, t371, t376, t382, t387, t392, t397, t402, t407, t412, t417, t422, t427, t432, t437, t441, t446, t451, t457, t462, t467, t472, t477, t482, t487, t492, t497, t502, t507, t509, t363.t124.t130, t364.t127.t130, t368.t132.t138, t369.t135.t138, t373.t140.t146, t374.t143.t146, t378.t148.t153, t379.t150.t153, t384.t155.t161, t385.t158.t161, t389.t163.t169, t390.t166.t169, t394.t171.t177, t395.t174.t177, t399.t179.t185, t400.t182.t185, t404.t187.t193, t405.t190.t193, t409.t195.t357, t410.t198.t357, t414.t201.t207, t415.t204.t207, t419.t209.t215, t420.t212.t215, t424.t217.t223, t425.t220.t223, t429.t225.t231, t430.t228.t231, t434.t233.t239, t435.t236.t239, t439.t359.t245, t440.t242.t245, t444.t247.t253, t445.t250.t253, t449.t255.t261, t450.t258.t261, t454.t263.t269, t455.t266.t269, t459.t270.t276, t459.t270.t277, t459.t271.t276, t459.t271.t277, t460.t274.t277, t464.t279.t285, t465.t282.t285, t469.t287.t293, t470.t290.t293, t474.t295.t300, t475.t298.t300, t479.t302.t308, t480.t305.t308, t484.t310.t316, t485.t313.t316, t489.t318.t324, t490.t321.t324, t494.t326.t332, t495.t329.t332, t499.t334.t340, t500.t337.t340, t504.t342.t348, t505.t345.t348, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/449/121/570
Computing Next relation with stutter on 4.12205e+36 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
527 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.34417,167976,1,0,1109,1.07984e+06,1170,411,20389,481576,1226
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-030B-07 finished in 30601 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 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1777 transition count 1269
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1419 transition count 1269
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 716 place count 1419 transition count 1030
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1194 place count 1180 transition count 1030
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1200 place count 1174 transition count 1024
Iterating global reduction 2 with 6 rules applied. Total rules applied 1206 place count 1174 transition count 1024
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1206 place count 1174 transition count 1020
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1214 place count 1170 transition count 1020
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2226 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2227 place count 664 transition count 513
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 2229 place count 663 transition count 512
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2405 place count 575 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2406 place count 574 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2408 place count 572 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2408 place count 572 transition count 568
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 2410 place count 571 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2411 place count 570 transition count 567
Applied a total of 2411 rules in 266 ms. Remains 570 /1778 variables (removed 1208) and now considering 567/1628 (removed 1061) transitions.
// Phase 1: matrix 567 rows 570 cols
[2021-05-15 19:31:30] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:31:31] [INFO ] Implicit Places using invariants in 307 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
[2021-05-15 19:31:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 567 rows 569 cols
[2021-05-15 19:31:31] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:31:31] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Starting structural reductions, iteration 1 : 569/1778 places, 567/1628 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 568 transition count 566
Applied a total of 2 rules in 17 ms. Remains 568 /569 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 568 cols
[2021-05-15 19:31:31] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:31:31] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 566 rows 568 cols
[2021-05-15 19:31:31] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:31:32] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 568/1778 places, 566/1628 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-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 s292 0) (EQ s71 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-10 finished in 2400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(F(p0)))||(F(p0)&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1771 transition count 1621
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1771 transition count 1621
Applied a total of 14 rules in 203 ms. Remains 1771 /1778 variables (removed 7) and now considering 1621/1628 (removed 7) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:31:32] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:31:32] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:31:32] [INFO ] Computed 271 place invariants in 6 ms
[2021-05-15 19:31:34] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:31:34] [INFO ] Computed 271 place invariants in 14 ms
[2021-05-15 19:31:35] [INFO ] Dead Transitions using invariants and state equation in 868 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1778 places, 1621/1628 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s69 0) (EQ s1397 1)), p1:(OR (EQ s1237 0) (EQ s1206 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 828 ms.
Product exploration explored 100000 steps with 33333 reset in 836 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 828 ms.
Product exploration explored 100000 steps with 33333 reset in 835 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1771 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1771 transition count 1621
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 356 place count 1771 transition count 1804
Deduced a syphon composed of 507 places in 2 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 507 place count 1771 transition count 1804
Performed 569 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1076 places in 1 ms
Iterating global reduction 1 with 569 rules applied. Total rules applied 1076 place count 1771 transition count 1805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1077 place count 1771 transition count 1804
Renaming transitions due to excessive name length > 1024 char.
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 1286 place count 1562 transition count 1595
Deduced a syphon composed of 867 places in 1 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1495 place count 1562 transition count 1595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 868 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1496 place count 1562 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1498 place count 1560 transition count 1593
Deduced a syphon composed of 866 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1500 place count 1560 transition count 1593
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -481
Deduced a syphon composed of 954 places in 2 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1588 place count 1560 transition count 2074
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 1676 place count 1472 transition count 1898
Deduced a syphon composed of 866 places in 1 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1764 place count 1472 transition count 1898
Deduced a syphon composed of 866 places in 2 ms
Applied a total of 1764 rules in 902 ms. Remains 1472 /1771 variables (removed 299) and now considering 1898/1621 (removed -277) transitions.
[2021-05-15 19:31:48] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1898 rows 1472 cols
[2021-05-15 19:31:48] [INFO ] Computed 271 place invariants in 10 ms
[2021-05-15 19:31:49] [INFO ] Dead Transitions using invariants and state equation in 864 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1472/1771 places, 1898/1621 transitions.
Product exploration explored 100000 steps with 33333 reset in 884 ms.
Product exploration explored 100000 steps with 33333 reset in 838 ms.
[2021-05-15 19:31:51] [INFO ] Flatten gal took : 55 ms
[2021-05-15 19:31:51] [INFO ] Flatten gal took : 53 ms
[2021-05-15 19:32:04] [INFO ] Time to serialize gal into /tmp/LTL9601843547813256737.gal : 12900 ms
[2021-05-15 19:32:04] [INFO ] Time to serialize properties into /tmp/LTL12793305367750006408.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9601843547813256737.gal, -t, CGAL, -LTL, /tmp/LTL12793305367750006408.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/LTL9601843547813256737.gal -t CGAL -LTL /tmp/LTL12793305367750006408.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((p73==0)||(p1651==1))"))))||((F("((p73==0)||(p1651==1))"))&&(X("((p1463==0)||(p1426==1))"))))))
Formula 0 simplified : !X(XXF"((p73==0)||(p1651==1))" | (F"((p73==0)||(p1651==1))" & X"((p1463==0)||(p1426==1))"))
Detected timeout of ITS tools.
[2021-05-15 19:32:19] [INFO ] Flatten gal took : 46 ms
[2021-05-15 19:32:19] [INFO ] Applying decomposition
[2021-05-15 19:32:19] [INFO ] Flatten gal took : 45 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/graph14203540050173897885.txt, -o, /tmp/graph14203540050173897885.bin, -w, /tmp/graph14203540050173897885.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/graph14203540050173897885.bin, -l, -1, -v, -w, /tmp/graph14203540050173897885.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:32:21] [INFO ] Decomposing Gal with order
[2021-05-15 19:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:32:21] [INFO ] Removed a total of 297 redundant transitions.
[2021-05-15 19:32:21] [INFO ] Flatten gal took : 138 ms
[2021-05-15 19:32:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-15 19:32:22] [INFO ] Time to serialize gal into /tmp/LTL17036882600505190283.gal : 38 ms
[2021-05-15 19:32:22] [INFO ] Time to serialize properties into /tmp/LTL4287443381763277501.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/LTL17036882600505190283.gal, -t, CGAL, -LTL, /tmp/LTL4287443381763277501.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/LTL17036882600505190283.gal -t CGAL -LTL /tmp/LTL4287443381763277501.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("((i1.i6.u27.p73==0)||(i23.i4.u518.p1651==1))"))))||((F("((i1.i6.u27.p73==0)||(i23.i4.u518.p1651==1))"))&&(X("((i20.i6.u461.p1463==0)||(i20.i1.u449.p1426==1))"))))))
Formula 0 simplified : !X(XXF"((i1.i6.u27.p73==0)||(i23.i4.u518.p1651==1))" | (F"((i1.i6.u27.p73==0)||(i23.i4.u518.p1651==1))" & X"((i20.i6.u461.p1463==0)||(i20.i1.u449.p1426==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3912492916277151971
[2021-05-15 19:32:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3912492916277151971
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/ltsmin3912492916277151971]
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/ltsmin3912492916277151971] 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/ltsmin3912492916277151971] 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-030B-12 finished in 69911 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1771 transition count 1621
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1771 transition count 1621
Applied a total of 14 rules in 175 ms. Remains 1771 /1778 variables (removed 7) and now considering 1621/1628 (removed 7) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:32:42] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:32:42] [INFO ] Implicit Places using invariants in 519 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:32:42] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:32:44] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2021-05-15 19:32:44] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:32:45] [INFO ] Dead Transitions using invariants and state equation in 849 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1771/1778 places, 1621/1628 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s266 0) (NEQ s1292 1)), p0:(OR (EQ s1292 0) (EQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-13 finished in 3043 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 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1777 transition count 1270
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 1420 transition count 1270
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 714 place count 1420 transition count 1032
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1190 place count 1182 transition count 1032
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1177 transition count 1027
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1177 transition count 1027
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1200 place count 1177 transition count 1024
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1206 place count 1174 transition count 1024
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2220 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 667 transition count 516
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 2223 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2401 place count 577 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2402 place count 576 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2404 place count 574 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2404 place count 574 transition count 572
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2406 place count 573 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2407 place count 572 transition count 571
Applied a total of 2407 rules in 228 ms. Remains 572 /1778 variables (removed 1206) and now considering 571/1628 (removed 1057) transitions.
// Phase 1: matrix 571 rows 572 cols
[2021-05-15 19:32:45] [INFO ] Computed 269 place invariants in 1 ms
[2021-05-15 19:32:45] [INFO ] Implicit Places using invariants in 279 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
[2021-05-15 19:32:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 571 rows 571 cols
[2021-05-15 19:32:45] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:32:46] [INFO ] Dead Transitions using invariants and state equation in 311 ms returned []
Starting structural reductions, iteration 1 : 571/1778 places, 571/1628 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 570 transition count 570
Applied a total of 2 rules in 14 ms. Remains 570 /571 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 570 cols
[2021-05-15 19:32:46] [INFO ] Computed 268 place invariants in 0 ms
[2021-05-15 19:32:46] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 570 rows 570 cols
[2021-05-15 19:32:46] [INFO ] Computed 268 place invariants in 1 ms
[2021-05-15 19:32:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-15 19:32:47] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 570/1778 places, 570/1628 transitions.
Stuttering acceptance computed with spot in 13631 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s439 0) (EQ s439 1)) (OR (EQ s536 0) (EQ s281 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 624 ms.
Product exploration explored 100000 steps with 0 reset in 800 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-14 finished in 16935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G((G(p1)||(p2&&X(F(p3)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1778 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1778/1778 places, 1628/1628 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1772 transition count 1622
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1772 transition count 1622
Applied a total of 12 rules in 145 ms. Remains 1772 /1778 variables (removed 6) and now considering 1622/1628 (removed 6) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:33:02] [INFO ] Computed 271 place invariants in 5 ms
[2021-05-15 19:33:02] [INFO ] Implicit Places using invariants in 551 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:33:02] [INFO ] Computed 271 place invariants in 4 ms
[2021-05-15 19:33:04] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2021-05-15 19:33:04] [INFO ] Computed 271 place invariants in 13 ms
[2021-05-15 19:33:05] [INFO ] Dead Transitions using invariants and state equation in 981 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1772/1778 places, 1622/1628 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1454 0) (EQ s861 1)), p2:(EQ s612 1), p0:(AND (EQ s1770 0) (EQ s1190 1)), p3:(EQ s939 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 639 ms.
Stack based approach found an accepted trace after 8019 steps with 0 reset with depth 8020 and stack size 8020 in 72 ms.
FORMULA ShieldIIPt-PT-030B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-15 finished in 4005 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13807747514737507479
[2021-05-15 19:33:06] [INFO ] Too many transitions (1628) to apply POR reductions. Disabling POR matrices.
[2021-05-15 19:33:06] [INFO ] Applying decomposition
[2021-05-15 19:33:06] [INFO ] Flatten gal took : 42 ms
[2021-05-15 19:33:06] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13807747514737507479
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/ltsmin13807747514737507479]
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/graph10396192242860075499.txt, -o, /tmp/graph10396192242860075499.bin, -w, /tmp/graph10396192242860075499.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/graph10396192242860075499.bin, -l, -1, -v, -w, /tmp/graph10396192242860075499.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 19:33:19] [INFO ] Decomposing Gal with order
[2021-05-15 19:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 19:33:19] [INFO ] Removed a total of 294 redundant transitions.
[2021-05-15 19:33:19] [INFO ] Flatten gal took : 98 ms
[2021-05-15 19:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 19:33:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality12309971566961587347.gal : 604 ms
[2021-05-15 19:33:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality1233263604887004613.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/LTLCardinality12309971566961587347.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1233263604887004613.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/LTLCardinality12309971566961587347.gal -t CGAL -LTL /tmp/LTLCardinality1233263604887004613.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((X("((i20.u460.p1463==0)||(i20.u449.p1426==1))"))&&(F("((i0.u27.p73==0)||(i23.u521.p1651==1))")))||(X(X(F("((i0.u27.p73==0)||(i23.u521.p1651==1))")))))))
Formula 0 simplified : !X((X"((i20.u460.p1463==0)||(i20.u449.p1426==1))" & F"((i0.u27.p73==0)||(i23.u521.p1651==1))") | XXF"((i0.u27.p73==0)||(i23.u521.p1651==1))")
Compilation finished in 16307 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13807747514737507479]
Link finished in 55 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((X(X(<>((LTLAPp0==true))))||(<>((LTLAPp0==true))&&X((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13807747514737507479]
LTSmin run took 1034 ms.
FORMULA ShieldIIPt-PT-030B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621107205316

--------------------
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-030B"
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-030B, 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-162098205100460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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