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-162098205600789.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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.5K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020A-00
FORMULA_NAME ShieldPPPt-PT-020A-01
FORMULA_NAME ShieldPPPt-PT-020A-02
FORMULA_NAME ShieldPPPt-PT-020A-03
FORMULA_NAME ShieldPPPt-PT-020A-04
FORMULA_NAME ShieldPPPt-PT-020A-05
FORMULA_NAME ShieldPPPt-PT-020A-06
FORMULA_NAME ShieldPPPt-PT-020A-07
FORMULA_NAME ShieldPPPt-PT-020A-08
FORMULA_NAME ShieldPPPt-PT-020A-09
FORMULA_NAME ShieldPPPt-PT-020A-10
FORMULA_NAME ShieldPPPt-PT-020A-11
FORMULA_NAME ShieldPPPt-PT-020A-12
FORMULA_NAME ShieldPPPt-PT-020A-13
FORMULA_NAME ShieldPPPt-PT-020A-14
FORMULA_NAME ShieldPPPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1621177426318

Running Version 0
[2021-05-16 15:03:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 15:03:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:03:54] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2021-05-16 15:03:54] [INFO ] Transformed 503 places.
[2021-05-16 15:03:54] [INFO ] Transformed 363 transitions.
[2021-05-16 15:03:54] [INFO ] Found NUPN structural information;
[2021-05-16 15:03:54] [INFO ] Parsed PT model containing 503 places and 363 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:03:54] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-020A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 51 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:03:55] [INFO ] Computed 221 place invariants in 23 ms
[2021-05-16 15:03:55] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:03:55] [INFO ] Computed 221 place invariants in 7 ms
[2021-05-16 15:03:55] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:03:55] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:03:56] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
[2021-05-16 15:03:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 15:03:56] [INFO ] Flatten gal took : 78 ms
FORMULA ShieldPPPt-PT-020A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:03:56] [INFO ] Flatten gal took : 43 ms
[2021-05-16 15:03:56] [INFO ] Input system was already deterministic with 362 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=147 ) properties (out of 33) seen :21
Running SMT prover for 12 properties.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:03:57] [INFO ] Computed 221 place invariants in 3 ms
[2021-05-16 15:03:57] [INFO ] [Real]Absence check using 221 positive place invariants in 31 ms returned sat
[2021-05-16 15:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:57] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-16 15:03:57] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-16 15:03:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:03:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 62 ms returned sat
[2021-05-16 15:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:03:58] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-16 15:03:58] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-16 15:04:00] [INFO ] Added : 312 causal constraints over 67 iterations in 2275 ms. Result :sat
[2021-05-16 15:04:00] [INFO ] [Real]Absence check using 221 positive place invariants in 56 ms returned sat
[2021-05-16 15:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:00] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-16 15:04:00] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-16 15:04:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2021-05-16 15:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:01] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-16 15:04:01] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-16 15:04:02] [INFO ] Added : 300 causal constraints over 61 iterations in 1905 ms. Result :sat
[2021-05-16 15:04:03] [INFO ] [Real]Absence check using 221 positive place invariants in 31 ms returned sat
[2021-05-16 15:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:03] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-16 15:04:03] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-16 15:04:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 35 ms returned sat
[2021-05-16 15:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:03] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-16 15:04:03] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:10] [INFO ] Added : 205 causal constraints over 41 iterations in 6671 ms. Result :sat
[2021-05-16 15:04:10] [INFO ] [Real]Absence check using 221 positive place invariants in 31 ms returned sat
[2021-05-16 15:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:10] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-16 15:04:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:10] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2021-05-16 15:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-16 15:04:10] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-16 15:04:13] [INFO ] Added : 315 causal constraints over 65 iterations in 2456 ms. Result :sat
[2021-05-16 15:04:13] [INFO ] [Real]Absence check using 221 positive place invariants in 32 ms returned sat
[2021-05-16 15:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:13] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-16 15:04:13] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-16 15:04:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:13] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2021-05-16 15:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:13] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-16 15:04:13] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-16 15:04:15] [INFO ] Added : 286 causal constraints over 59 iterations in 1981 ms. Result :sat
[2021-05-16 15:04:15] [INFO ] [Real]Absence check using 221 positive place invariants in 47 ms returned sat
[2021-05-16 15:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:15] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-16 15:04:15] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-16 15:04:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:16] [INFO ] [Nat]Absence check using 221 positive place invariants in 31 ms returned sat
[2021-05-16 15:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:16] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-16 15:04:16] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:18] [INFO ] Added : 310 causal constraints over 64 iterations in 2212 ms. Result :sat
[2021-05-16 15:04:18] [INFO ] [Real]Absence check using 221 positive place invariants in 34 ms returned sat
[2021-05-16 15:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:18] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-16 15:04:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:18] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2021-05-16 15:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:18] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-16 15:04:18] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:21] [INFO ] Added : 337 causal constraints over 70 iterations in 2276 ms. Result :sat
[2021-05-16 15:04:21] [INFO ] [Real]Absence check using 221 positive place invariants in 32 ms returned sat
[2021-05-16 15:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:21] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-16 15:04:21] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-16 15:04:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2021-05-16 15:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:21] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-16 15:04:21] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:23] [INFO ] Added : 293 causal constraints over 61 iterations in 1924 ms. Result :sat
[2021-05-16 15:04:23] [INFO ] [Real]Absence check using 221 positive place invariants in 47 ms returned sat
[2021-05-16 15:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:24] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-16 15:04:24] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-16 15:04:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:24] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2021-05-16 15:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:24] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-16 15:04:24] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:26] [INFO ] Added : 286 causal constraints over 61 iterations in 2140 ms. Result :sat
[2021-05-16 15:04:26] [INFO ] [Real]Absence check using 221 positive place invariants in 36 ms returned sat
[2021-05-16 15:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:26] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-16 15:04:26] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-16 15:04:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:26] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2021-05-16 15:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:27] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-16 15:04:27] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-16 15:04:29] [INFO ] Added : 303 causal constraints over 62 iterations in 2049 ms. Result :sat
[2021-05-16 15:04:29] [INFO ] [Real]Absence check using 221 positive place invariants in 35 ms returned sat
[2021-05-16 15:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:29] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-16 15:04:29] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-16 15:04:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:29] [INFO ] [Nat]Absence check using 221 positive place invariants in 37 ms returned sat
[2021-05-16 15:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:29] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-16 15:04:29] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-16 15:04:31] [INFO ] Added : 296 causal constraints over 60 iterations in 1853 ms. Result :sat
[2021-05-16 15:04:31] [INFO ] [Real]Absence check using 221 positive place invariants in 34 ms returned sat
[2021-05-16 15:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:31] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-16 15:04:31] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-16 15:04:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:04:32] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2021-05-16 15:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:04:32] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-16 15:04:32] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-16 15:04:35] [INFO ] Added : 337 causal constraints over 72 iterations in 2873 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 360
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 500 transition count 358
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 498 transition count 358
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 0 with 2 rules applied. Total rules applied 9 place count 497 transition count 357
Applied a total of 9 rules in 90 ms. Remains 497 /503 variables (removed 6) and now considering 357/362 (removed 5) transitions.
// Phase 1: matrix 357 rows 497 cols
[2021-05-16 15:04:35] [INFO ] Computed 220 place invariants in 2 ms
[2021-05-16 15:04:35] [INFO ] Implicit Places using invariants in 263 ms returned [480, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 266 ms to find 2 implicit places.
[2021-05-16 15:04:35] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 357 rows 495 cols
[2021-05-16 15:04:35] [INFO ] Computed 218 place invariants in 2 ms
[2021-05-16 15:04:35] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Starting structural reductions, iteration 1 : 495/503 places, 357/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 355
Applied a total of 4 rules in 63 ms. Remains 493 /495 variables (removed 2) and now considering 355/357 (removed 2) transitions.
// Phase 1: matrix 355 rows 493 cols
[2021-05-16 15:04:35] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:04:36] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 355 rows 493 cols
[2021-05-16 15:04:36] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:04:36] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 493/503 places, 355/362 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s323 1), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 559 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldPPPt-PT-020A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-00 finished in 2203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 26 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2021-05-16 15:04:37] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:04:37] [INFO ] Implicit Places using invariants in 268 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
[2021-05-16 15:04:37] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 360 rows 500 cols
[2021-05-16 15:04:37] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:04:37] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Starting structural reductions, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 29 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2021-05-16 15:04:38] [INFO ] Computed 220 place invariants in 2 ms
[2021-05-16 15:04:38] [INFO ] Implicit Places using invariants in 263 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 264 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 21 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:04:38] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:04:38] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:04:38] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:04:39] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 494/503 places, 356/362 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s347 1), p1:(OR (NEQ s30 1) (NEQ s47 1)), p2:(NEQ s201 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 474 ms.
Stack based approach found an accepted trace after 23542 steps with 0 reset with depth 23543 and stack size 9059 in 135 ms.
FORMULA ShieldPPPt-PT-020A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-01 finished in 2342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:04:39] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:04:39] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:04:39] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:04:40] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:04:40] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:04:40] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 18090 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (NEQ s28 1) (NEQ s51 1)), p0:(OR (NEQ s30 1) (NEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-020A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-02 finished in 19522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(p0&&((F(p1)&&F(p2))||G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 21 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2021-05-16 15:04:59] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:04:59] [INFO ] Implicit Places using invariants in 296 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
[2021-05-16 15:04:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 360 rows 500 cols
[2021-05-16 15:04:59] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:04:59] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Starting structural reductions, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 17 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2021-05-16 15:04:59] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:05:00] [INFO ] Implicit Places using invariants in 258 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 259 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 24 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:05:00] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:00] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:05:00] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:00] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 494/503 places, 356/362 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020A-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s443 1) (NEQ s450 1)), p1:(NEQ s149 0), p2:(AND (EQ s57 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 479 ms.
Stack based approach found an accepted trace after 116 steps with 0 reset with depth 117 and stack size 88 in 2 ms.
FORMULA ShieldPPPt-PT-020A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-03 finished in 2238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((F(p1)&&G(p2)&&p0))&&X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 8 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:01] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:01] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:01] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:02] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:02] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:02] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-020A-04 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s479 1) (EQ s498 1)), p2:(AND (EQ s205 1) (EQ s222 1)), p1:(OR (EQ s445 0) (EQ s460 0) (EQ s117 0) (EQ s119 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-04 finished in 1145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:02] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:02] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:02] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:03] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:03] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:05:03] [INFO ] Dead Transitions using invariants and state equation in 256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s63 1) (NEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 585 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 7601 steps with 0 reset in 31 ms.
FORMULA ShieldPPPt-PT-020A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-05 finished in 19933 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(p1)||(X(p2)&&(X(X(p1))||p3)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:22] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:22] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:22] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:23] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:23] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:23] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020A-06 automaton TGBA [mat=[[{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p3), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (EQ s262 1) (EQ s264 1)), p3:(OR (EQ s1 0) (EQ s24 0)), p1:(AND (EQ s262 1) (EQ s264 1)), p2:(AND (EQ s1 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 438 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-020A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-06 finished in 1578 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 360
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 500 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 498 transition count 358
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 9 place count 497 transition count 357
Applied a total of 9 rules in 25 ms. Remains 497 /503 variables (removed 6) and now considering 357/362 (removed 5) transitions.
// Phase 1: matrix 357 rows 497 cols
[2021-05-16 15:05:24] [INFO ] Computed 220 place invariants in 0 ms
[2021-05-16 15:05:24] [INFO ] Implicit Places using invariants in 266 ms returned [480, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
[2021-05-16 15:05:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 357 rows 495 cols
[2021-05-16 15:05:24] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:24] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Starting structural reductions, iteration 1 : 495/503 places, 357/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 355
Applied a total of 4 rules in 15 ms. Remains 493 /495 variables (removed 2) and now considering 355/357 (removed 2) transitions.
// Phase 1: matrix 355 rows 493 cols
[2021-05-16 15:05:24] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:24] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 355 rows 493 cols
[2021-05-16 15:05:24] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:25] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 493/503 places, 355/362 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-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:(EQ s271 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 12 reset in 405 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA ShieldPPPt-PT-020A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-07 finished in 1708 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(!p0&&X((F((p1&&X(p2)))||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:25] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:26] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:26] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:26] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:26] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:26] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), false, false, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020A-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (NEQ s356 1) (NEQ s371 1)), p2:(AND (EQ s54 1) (EQ s73 1)), p0:(AND (EQ s407 1) (EQ s409 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 428 ms.
Stack based approach found an accepted trace after 620 steps with 0 reset with depth 621 and stack size 621 in 3 ms.
FORMULA ShieldPPPt-PT-020A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-08 finished in 1539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Applied a total of 4 rules in 16 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
// Phase 1: matrix 360 rows 501 cols
[2021-05-16 15:05:27] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:27] [INFO ] Implicit Places using invariants in 284 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
[2021-05-16 15:05:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 360 rows 500 cols
[2021-05-16 15:05:27] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:05:27] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Starting structural reductions, iteration 1 : 500/503 places, 360/362 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 500 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 358
Applied a total of 4 rules in 14 ms. Remains 498 /500 variables (removed 2) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 498 cols
[2021-05-16 15:05:27] [INFO ] Computed 220 place invariants in 1 ms
[2021-05-16 15:05:28] [INFO ] Implicit Places using invariants in 280 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 282 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 496/503 places, 358/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 356
Applied a total of 4 rules in 14 ms. Remains 494 /496 variables (removed 2) and now considering 356/358 (removed 2) transitions.
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:05:28] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:28] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 356 rows 494 cols
[2021-05-16 15:05:28] [INFO ] Computed 218 place invariants in 1 ms
[2021-05-16 15:05:28] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 494/503 places, 356/362 transitions.
Stuttering acceptance computed with spot in 16005 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s76 1) (EQ s42 1) (EQ s44 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]]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Stack based approach found an accepted trace after 253 steps with 0 reset with depth 254 and stack size 254 in 2 ms.
FORMULA ShieldPPPt-PT-020A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-09 finished in 18016 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(X(p1) U ((p2&&X(p1))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:45] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:45] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:45] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:46] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:05:46] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:05:46] [INFO ] Dead Transitions using invariants and state equation in 302 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(NEQ s45 1), p2:(OR (NEQ s406 1) (NEQ s421 1)), p0:(AND (EQ s438 1) (EQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1202 ms.
Product exploration explored 100000 steps with 50000 reset in 1233 ms.
Knowledge obtained : [p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1188 ms.
Product exploration explored 100000 steps with 50000 reset in 1223 ms.
Applying partial POR strategy [true, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Support contains 5 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 503 transition count 362
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 44 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
[2021-05-16 15:06:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:06] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:06] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Product exploration explored 100000 steps with 50000 reset in 3281 ms.
Product exploration explored 100000 steps with 50000 reset in 3279 ms.
[2021-05-16 15:06:13] [INFO ] Flatten gal took : 34 ms
[2021-05-16 15:06:13] [INFO ] Flatten gal took : 32 ms
[2021-05-16 15:06:13] [INFO ] Time to serialize gal into /tmp/LTL9786934101872067230.gal : 11 ms
[2021-05-16 15:06:13] [INFO ] Time to serialize properties into /tmp/LTL8157689916384532456.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/LTL9786934101872067230.gal, -t, CGAL, -LTL, /tmp/LTL8157689916384532456.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/LTL9786934101872067230.gal -t CGAL -LTL /tmp/LTL8157689916384532456.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("((p438==1)&&(p452==1))")))||((X("(p45==0)"))U((("((p406==0)||(p421==0))")&&(X("(p45==0)")))||(X(G("(p45==0)")))))))
Formula 0 simplified : !(XG"((p438==1)&&(p452==1))" | (X"(p45==0)" U (("((p406==0)||(p421==0))" & X"(p45==0)") | XG"(p45==0)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
241 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,2.46461,59240,1,0,6,236497,25,0,11775,266496,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-020A-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-020A-11 finished in 49846 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 18 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:35] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:35] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:35] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:36] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:36] [INFO ] Computed 221 place invariants in 2 ms
[2021-05-16 15:06:36] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s38 1) (NEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Entered a terminal (fully accepting) state of product in 6145 steps with 0 reset in 31 ms.
FORMULA ShieldPPPt-PT-020A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-13 finished in 1523 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F((F(p1)&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:36] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:37] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:37] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:37] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:06:37] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:06:37] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut14990029545822377295.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p0 | G!p0)&(G p1 | G!p1)&(G p2 | G!p2)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 22528 ms :[false, false, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s351 1), p1:(EQ s351 0), p2:(NEQ s495 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 56 reset in 423 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 1 ms.
FORMULA ShieldPPPt-PT-020A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020A-14 finished in 24013 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0)||X(G((p1 U p2)))) U p3)))], workingDir=/home/mcc/execution]
Support contains 8 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 362/362 transitions.
Applied a total of 0 rules in 6 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:07:00] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:07:01] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:07:01] [INFO ] Computed 221 place invariants in 0 ms
[2021-05-16 15:07:01] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
// Phase 1: matrix 362 rows 503 cols
[2021-05-16 15:07:01] [INFO ] Computed 221 place invariants in 1 ms
[2021-05-16 15:07:01] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 503/503 places, 362/362 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-020A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(OR (NEQ s206 1) (NEQ s221 1)), p0:(AND (EQ s331 1) (EQ s346 1)), p2:(AND (EQ s236 1) (EQ s246 1)), p1:(AND (EQ s386 1) (EQ s396 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 50000 reset in 1137 ms.
Product exploration explored 100000 steps with 50000 reset in 1180 ms.
Knowledge obtained : [p3, (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 1187 ms.
Product exploration explored 100000 steps with 50000 reset in 1228 ms.
java.io.IOException: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut11326905893277142446.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:313)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:195)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Caused by: java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autstates.py, /tmp/curaut11326905893277142446.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.computeForwardClosedSI(SpotRunner.java:311)
... 18 more
[2021-05-16 15:07:31] [INFO ] Flatten gal took : 32 ms
[2021-05-16 15:07:31] [INFO ] Flatten gal took : 30 ms
[2021-05-16 15:07:31] [INFO ] Time to serialize gal into /tmp/LTL2064611399096916547.gal : 63 ms
[2021-05-16 15:07:31] [INFO ] Time to serialize properties into /tmp/LTL4544732056083898683.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/LTL2064611399096916547.gal, -t, CGAL, -LTL, /tmp/LTL4544732056083898683.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/LTL2064611399096916547.gal -t CGAL -LTL /tmp/LTL4544732056083898683.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("((p331==1)&&(p346==1))"))||(X(G(("((p386==1)&&(p396==1))")U("((p236==1)&&(p246==1))")))))U("((p206==0)||(p221==0))"))))
Formula 0 simplified : !X((F"((p331==1)&&(p346==1))" | XG("((p386==1)&&(p396==1))" U "((p236==1)&&(p246==1))")) U "((p206==0)||(p221==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
255 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,2.59676,59136,1,0,6,236497,19,0,11770,266496,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-020A-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-020A-15 finished in 32980 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621177654803

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020A, examination is LTLFireability"
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-162098205600789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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