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-162098204800229.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 ShieldIIPs-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204800229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:40 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 42K 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 ShieldIIPs-PT-005A-00
FORMULA_NAME ShieldIIPs-PT-005A-01
FORMULA_NAME ShieldIIPs-PT-005A-02
FORMULA_NAME ShieldIIPs-PT-005A-03
FORMULA_NAME ShieldIIPs-PT-005A-04
FORMULA_NAME ShieldIIPs-PT-005A-05
FORMULA_NAME ShieldIIPs-PT-005A-06
FORMULA_NAME ShieldIIPs-PT-005A-07
FORMULA_NAME ShieldIIPs-PT-005A-08
FORMULA_NAME ShieldIIPs-PT-005A-09
FORMULA_NAME ShieldIIPs-PT-005A-10
FORMULA_NAME ShieldIIPs-PT-005A-11
FORMULA_NAME ShieldIIPs-PT-005A-12
FORMULA_NAME ShieldIIPs-PT-005A-13
FORMULA_NAME ShieldIIPs-PT-005A-14
FORMULA_NAME ShieldIIPs-PT-005A-15

=== Now, execution of the tool begins

BK_START 1621060266750

Running Version 0
[2021-05-15 06:31:22] [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-15 06:31:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 06:31:23] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-15 06:31:23] [INFO ] Transformed 128 places.
[2021-05-15 06:31:23] [INFO ] Transformed 123 transitions.
[2021-05-15 06:31:23] [INFO ] Found NUPN structural information;
[2021-05-15 06:31:23] [INFO ] Parsed PT model containing 128 places and 123 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 06:31:23] [INFO ] Initial state test concluded for 4 properties.
FORMULA ShieldIIPs-PT-005A-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 13 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:23] [INFO ] Computed 46 place invariants in 14 ms
[2021-05-15 06:31:23] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:23] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-15 06:31:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:23] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-15 06:31:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
[2021-05-15 06:31:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 06:31:23] [INFO ] Flatten gal took : 41 ms
FORMULA ShieldIIPs-PT-005A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 06:31:23] [INFO ] Flatten gal took : 16 ms
[2021-05-15 06:31:23] [INFO ] Input system was already deterministic with 123 transitions.
Finished random walk after 1007 steps, including 3 resets, run visited all 25 properties in 15 ms. (steps per millisecond=67 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
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 4 place count 126 transition count 121
Applied a total of 4 rules in 30 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:31:23] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 06:31:24] [INFO ] Implicit Places using invariants in 85 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
[2021-05-15 06:31:24] [INFO ] Redundant transitions in 18 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:24] [INFO ] Computed 45 place invariants in 5 ms
[2021-05-15 06:31:24] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:31:24] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:24] [INFO ] Computed 45 place invariants in 3 ms
[2021-05-15 06:31:24] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s36 1) (EQ s40 1) (EQ s52 1) (EQ s61 1) (EQ s65 1) (EQ s76 1)) (AND (EQ s105 1) (EQ s115 1))), p1:(AND (EQ s36 1) (EQ s40 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-005A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-00 finished in 549 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 121
Applied a total of 4 rules in 16 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:31:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:24] [INFO ] Implicit Places using invariants in 74 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
[2021-05-15 06:31:24] [INFO ] Redundant transitions in 16 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:24] [INFO ] Computed 45 place invariants in 4 ms
[2021-05-15 06:31:24] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:31:24] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:24] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 06:31:24] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 267 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-01 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&(G(p0)||X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:24] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 06:31:24] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:24] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-005A-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s71 1) (EQ s75 1)), p1:(OR (NEQ s1 1) (NEQ s20 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-03 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
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 4 place count 126 transition count 121
Applied a total of 4 rules in 9 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 06:31:25] [INFO ] Implicit Places using invariants in 74 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
[2021-05-15 06:31:25] [INFO ] Redundant transitions in 22 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:25] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 06:31:25] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:31:25] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:31:25] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 06:31:25] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s87 1) (EQ s117 1)), p0:(AND (EQ s11 1) (EQ s15 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-04 finished in 338 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p1)&&F(p2)&&p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:25] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:25] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:25] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s115 1) (OR (EQ s86 0) (EQ s90 0) (EQ s101 0))), p2:(AND (NEQ s11 0) (NEQ s15 0) (NEQ s26 0)), p1:(AND (NEQ s36 0) (NEQ s42 0) (NEQ s51 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 336 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-05 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 06:31:25] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:31:26] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005A-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s121 1) (AND (EQ s39 1) (EQ s60 1))), p0:(NEQ s121 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][false, false, false, false]]
Product exploration explored 100000 steps with 2292 reset in 341 ms.
Product exploration explored 100000 steps with 2253 reset in 318 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2190 reset in 264 ms.
Product exploration explored 100000 steps with 2215 reset in 251 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 126
Performed 1 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 1 rules applied. Total rules applied 2 place count 128 transition count 126
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 126/123 (removed -3) transitions.
[2021-05-15 06:31:27] [INFO ] Redundant transitions in 11 ms returned [118]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[118]
// Phase 1: matrix 125 rows 128 cols
[2021-05-15 06:31:27] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:27] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 128/128 places, 125/123 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2021-05-15 06:31:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 125 rows 128 cols
[2021-05-15 06:31:27] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:31:28] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 128/128 places, 125/123 transitions.
Product exploration explored 100000 steps with 2338 reset in 357 ms.
Product exploration explored 100000 steps with 2335 reset in 315 ms.
[2021-05-15 06:31:28] [INFO ] Flatten gal took : 12 ms
[2021-05-15 06:31:28] [INFO ] Flatten gal took : 11 ms
[2021-05-15 06:31:28] [INFO ] Time to serialize gal into /tmp/LTL12983502470286972044.gal : 14 ms
[2021-05-15 06:31:28] [INFO ] Time to serialize properties into /tmp/LTL15650493635350433953.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/LTL12983502470286972044.gal, -t, CGAL, -LTL, /tmp/LTL15650493635350433953.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/LTL12983502470286972044.gal -t CGAL -LTL /tmp/LTL15650493635350433953.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p121==0)"))&&(F("((p121==1)||((p39==1)&&(p60==1)))")))))
Formula 0 simplified : !X(F"(p121==0)" & F"((p121==1)||((p39==1)&&(p60==1)))")
Detected timeout of ITS tools.
[2021-05-15 06:31:43] [INFO ] Flatten gal took : 10 ms
[2021-05-15 06:31:43] [INFO ] Applying decomposition
[2021-05-15 06:31:43] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12295686859824700749.txt, -o, /tmp/graph12295686859824700749.bin, -w, /tmp/graph12295686859824700749.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12295686859824700749.bin, -l, -1, -v, -w, /tmp/graph12295686859824700749.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 06:31:43] [INFO ] Decomposing Gal with order
[2021-05-15 06:31:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:31:44] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-15 06:31:44] [INFO ] Flatten gal took : 74 ms
[2021-05-15 06:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 12 ms.
[2021-05-15 06:31:44] [INFO ] Time to serialize gal into /tmp/LTL12489465658824026543.gal : 4 ms
[2021-05-15 06:31:44] [INFO ] Time to serialize properties into /tmp/LTL4451028960886758046.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/LTL12489465658824026543.gal, -t, CGAL, -LTL, /tmp/LTL4451028960886758046.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12489465658824026543.gal -t CGAL -LTL /tmp/LTL4451028960886758046.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(i4.i2.u44.p121==0)"))&&(F("((i4.i2.u44.p121==1)||((i1.i1.u15.p39==1)&&(i2.i2.u22.p60==1)))")))))
Formula 0 simplified : !X(F"(i4.i2.u44.p121==0)" & F"((i4.i2.u44.p121==1)||((i1.i1.u15.p39==1)&&(i2.i2.u22.p60==1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12886717811649518074
[2021-05-15 06:32:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12886717811649518074
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12886717811649518074]
Compilation finished in 612 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12886717811649518074]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12886717811649518074]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005A-06 finished in 57039 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
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 4 place count 126 transition count 121
Applied a total of 4 rules in 9 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:32:22] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:32:23] [INFO ] Implicit Places using invariants in 75 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
[2021-05-15 06:32:23] [INFO ] Redundant transitions in 11 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:32:23] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 06:32:23] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:32:23] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:32:23] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 06:32:23] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s41 1), p1:(AND (EQ s38 1) (EQ s48 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-07 finished in 651 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
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 4 place count 126 transition count 121
Applied a total of 4 rules in 7 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:32:23] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:32:23] [INFO ] Implicit Places using invariants in 74 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
[2021-05-15 06:32:23] [INFO ] Redundant transitions in 17 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:32:23] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 06:32:23] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:32:23] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:32:23] [INFO ] Computed 45 place invariants in 3 ms
[2021-05-15 06:32:23] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005A-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (EQ s36 1) (EQ s40 1) (EQ s52 1)), p0:(AND (EQ s7 1) (EQ s9 1)), p2:(OR (NEQ s28 1) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-08 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:32:23] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:32:24] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:32:24] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 06:32:24] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:32:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:32:24] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s23 0) (EQ s27 0))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 214 ms.
Product exploration explored 100000 steps with 25000 reset in 230 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 126
Performed 1 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 1 rules applied. Total rules applied 2 place count 128 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 126/123 (removed -3) transitions.
[2021-05-15 06:32:25] [INFO ] Redundant transitions in 11 ms returned [118]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[118]
// Phase 1: matrix 125 rows 128 cols
[2021-05-15 06:32:25] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-15 06:32:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 128/128 places, 125/123 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2021-05-15 06:32:25] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 125 rows 128 cols
[2021-05-15 06:32:25] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:32:25] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 128/128 places, 125/123 transitions.
Product exploration explored 100000 steps with 25000 reset in 431 ms.
Product exploration explored 100000 steps with 25000 reset in 442 ms.
[2021-05-15 06:32:26] [INFO ] Flatten gal took : 10 ms
[2021-05-15 06:32:26] [INFO ] Flatten gal took : 9 ms
[2021-05-15 06:32:26] [INFO ] Time to serialize gal into /tmp/LTL776822970055102986.gal : 2 ms
[2021-05-15 06:32:26] [INFO ] Time to serialize properties into /tmp/LTL4548424996258085449.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/LTL776822970055102986.gal, -t, CGAL, -LTL, /tmp/LTL4548424996258085449.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/LTL776822970055102986.gal -t CGAL -LTL /tmp/LTL4548424996258085449.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((p13==0)||(p23==0))||(p27==0))"))))))
Formula 0 simplified : !XXXF"(((p13==0)||(p23==0))||(p27==0))"
Detected timeout of ITS tools.
[2021-05-15 06:32:41] [INFO ] Flatten gal took : 11 ms
[2021-05-15 06:32:41] [INFO ] Applying decomposition
[2021-05-15 06:32:41] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph310825777358304562.txt, -o, /tmp/graph310825777358304562.bin, -w, /tmp/graph310825777358304562.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph310825777358304562.bin, -l, -1, -v, -w, /tmp/graph310825777358304562.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 06:32:42] [INFO ] Decomposing Gal with order
[2021-05-15 06:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:32:42] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-15 06:32:42] [INFO ] Flatten gal took : 19 ms
[2021-05-15 06:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2021-05-15 06:32:43] [INFO ] Time to serialize gal into /tmp/LTL14234623071665851220.gal : 576 ms
[2021-05-15 06:32:43] [INFO ] Time to serialize properties into /tmp/LTL6508868182510421527.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/LTL14234623071665851220.gal, -t, CGAL, -LTL, /tmp/LTL6508868182510421527.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14234623071665851220.gal -t CGAL -LTL /tmp/LTL6508868182510421527.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((i0.i0.u5.p13==0)||(i0.i0.u8.p23==0))||(i0.i1.u9.p27==0))"))))))
Formula 0 simplified : !XXXF"(((i0.i0.u5.p13==0)||(i0.i0.u8.p23==0))||(i0.i1.u9.p27==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8682746857308639392
[2021-05-15 06:32:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8682746857308639392
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682746857308639392]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682746857308639392] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8682746857308639392] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPs-PT-005A-09 finished in 37772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:02] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 06:33:02] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:02] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:33:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:02] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:33:02] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s86 1) (NEQ s92 1) (NEQ s102 1)), p1:(OR (NEQ s113 1) (NEQ s123 1) (NEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 477 reset in 253 ms.
Product exploration explored 100000 steps with 500 reset in 273 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 487 reset in 246 ms.
Product exploration explored 100000 steps with 482 reset in 270 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 6 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2021-05-15 06:33:03] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:03] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-15 06:33:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Product exploration explored 100000 steps with 512 reset in 256 ms.
Product exploration explored 100000 steps with 507 reset in 282 ms.
[2021-05-15 06:33:04] [INFO ] Flatten gal took : 8 ms
[2021-05-15 06:33:04] [INFO ] Flatten gal took : 8 ms
[2021-05-15 06:33:04] [INFO ] Time to serialize gal into /tmp/LTL10001990965725453901.gal : 1 ms
[2021-05-15 06:33:04] [INFO ] Time to serialize properties into /tmp/LTL17573511492177917942.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/LTL10001990965725453901.gal, -t, CGAL, -LTL, /tmp/LTL17573511492177917942.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/LTL10001990965725453901.gal -t CGAL -LTL /tmp/LTL17573511492177917942.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(((p113==0)||(p123==0))||(p125==0))")))&&("(((p86==0)||(p92==0))||(p102==0))")))))
Formula 0 simplified : !XX("(((p86==0)||(p92==0))||(p102==0))" & GF"(((p113==0)||(p123==0))||(p125==0))")
Detected timeout of ITS tools.
[2021-05-15 06:33:21] [INFO ] Flatten gal took : 7 ms
[2021-05-15 06:33:21] [INFO ] Applying decomposition
[2021-05-15 06:33:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph531063448030070724.txt, -o, /tmp/graph531063448030070724.bin, -w, /tmp/graph531063448030070724.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph531063448030070724.bin, -l, -1, -v, -w, /tmp/graph531063448030070724.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 06:33:21] [INFO ] Decomposing Gal with order
[2021-05-15 06:33:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:33:21] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-15 06:33:21] [INFO ] Flatten gal took : 12 ms
[2021-05-15 06:33:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 5 ms.
[2021-05-15 06:33:21] [INFO ] Time to serialize gal into /tmp/LTL17615069524098040246.gal : 3 ms
[2021-05-15 06:33:21] [INFO ] Time to serialize properties into /tmp/LTL1432395102269364544.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/LTL17615069524098040246.gal, -t, CGAL, -LTL, /tmp/LTL1432395102269364544.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17615069524098040246.gal -t CGAL -LTL /tmp/LTL1432395102269364544.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(((i4.i0.u41.p113==0)||(i4.i0.u44.p123==0))||(i4.i0.u45.p125==0))")))&&("(((i3.i2.u31.p86==0)||(i3.i2.u33.p92==0))||(i3.i1.u36.p102==0))")))))
Formula 0 simplified : !XX("(((i3.i2.u31.p86==0)||(i3.i2.u33.p92==0))||(i3.i1.u36.p102==0))" & GF"(((i4.i0.u41.p113==0)||(i4.i0.u44.p123==0))||(i4.i0.u45.p125==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8051240466727807727
[2021-05-15 06:33:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8051240466727807727
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8051240466727807727]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8051240466727807727] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8051240466727807727] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPs-PT-005A-10 finished in 36073 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
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 4 place count 126 transition count 121
Applied a total of 4 rules in 6 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:33:43] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:33:43] [INFO ] Implicit Places using invariants in 61 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
[2021-05-15 06:33:43] [INFO ] Redundant transitions in 10 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:33:43] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:33:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:33:43] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s38 1) (NEQ s46 1) (NEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 173 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-11 finished in 5509 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (F(p1) U p2)))], workingDir=/home/mcc/execution]
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 121
Applied a total of 4 rules in 6 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 06:33:43] [INFO ] Computed 46 place invariants in 0 ms
[2021-05-15 06:33:43] [INFO ] Implicit Places using invariants in 66 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
[2021-05-15 06:33:43] [INFO ] Redundant transitions in 9 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[113]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:33:43] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 125/128 places, 120/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2021-05-15 06:33:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 06:33:43] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/128 places, 120/123 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005A-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s11 1) (EQ s17 1) (EQ s26 1)), p0:(OR (AND (EQ s31 1) (EQ s42 1)) (AND (EQ s103 1) (EQ s121 1))), p1:(EQ s122 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7474 steps with 84 reset in 17 ms.
FORMULA ShieldIIPs-PT-005A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-13 finished in 346 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)&&(p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:43] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 06:33:43] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:43] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-15 06:33:43] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 06:33:43] [INFO ] Computed 46 place invariants in 5 ms
[2021-05-15 06:33:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s98 1) (EQ s102 1)), p1:(AND (EQ s7 1) (EQ s9 1)), p2:(AND (EQ s57 1) (EQ s59 1) (EQ s88 1) (EQ s98 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 269 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-15 finished in 426 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-15 06:33:44] [INFO ] Applying decomposition
[2021-05-15 06:33:44] [INFO ] Flatten gal took : 7 ms
Built C files in :
/tmp/ltsmin7630382289900915906
[2021-05-15 06:33:44] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2021-05-15 06:33:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 06:33:44] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2021-05-15 06:33:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17495922464553727773.txt, -o, /tmp/graph17495922464553727773.bin, -w, /tmp/graph17495922464553727773.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17495922464553727773.bin, -l, -1, -v, -w, /tmp/graph17495922464553727773.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 06:33:44] [INFO ] Decomposing Gal with order
[2021-05-15 06:33:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:33:44] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2021-05-15 06:33:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 06:33:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7630382289900915906
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7630382289900915906]
[2021-05-15 06:33:44] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-15 06:33:44] [INFO ] Flatten gal took : 11 ms
[2021-05-15 06:33:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2021-05-15 06:33:44] [INFO ] Time to serialize gal into /tmp/LTLFireability3630852226343299849.gal : 2 ms
[2021-05-15 06:33:44] [INFO ] Time to serialize properties into /tmp/LTLFireability8968361196110821045.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/LTLFireability3630852226343299849.gal, -t, CGAL, -LTL, /tmp/LTLFireability8968361196110821045.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3630852226343299849.gal -t CGAL -LTL /tmp/LTLFireability8968361196110821045.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X((F("(i4.i1.u44.p121!=1)"))&&(F("((i4.i1.u44.p121==1)||((i1.i0.u15.p39==1)&&(i2.i0.u22.p60==1)))")))))
Formula 0 simplified : !X(F"(i4.i1.u44.p121!=1)" & F"((i4.i1.u44.p121==1)||((i1.i0.u15.p39==1)&&(i2.i0.u22.p60==1)))")
Compilation finished in 650 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7630382289900915906]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
LTSmin run took 348 ms.
FORMULA ShieldIIPs-PT-005A-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp3==true)&&[](<>((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp3==true)&&[](<>((LTLAPp4==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.005: "X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.090: DFS-FIFO for weak LTL, using special progress label 129
pins2lts-mc-linux64( 0/ 8), 0.090: There are 130 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.090: State length is 129, there are 129 groups
pins2lts-mc-linux64( 0/ 8), 0.090: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.090: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.090: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.090: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.231: ~111 levels ~960 states ~6488 transitions
pins2lts-mc-linux64( 5/ 8), 0.233: ~173 levels ~1920 states ~9936 transitions
pins2lts-mc-linux64( 6/ 8), 0.239: ~205 levels ~3840 states ~18104 transitions
pins2lts-mc-linux64( 0/ 8), 0.257: ~183 levels ~7680 states ~22168 transitions
pins2lts-mc-linux64( 3/ 8), 0.271: ~232 levels ~15360 states ~42376 transitions
pins2lts-mc-linux64( 3/ 8), 0.309: ~232 levels ~30720 states ~74056 transitions
pins2lts-mc-linux64( 3/ 8), 0.401: ~232 levels ~61440 states ~139704 transitions
pins2lts-mc-linux64( 3/ 8), 0.635: ~232 levels ~122880 states ~273168 transitions
pins2lts-mc-linux64( 1/ 8), 0.943: ~213 levels ~245760 states ~458480 transitions
pins2lts-mc-linux64( 1/ 8), 1.683: ~213 levels ~491520 states ~925416 transitions
pins2lts-mc-linux64( 6/ 8), 3.396: ~210 levels ~983040 states ~2172024 transitions
pins2lts-mc-linux64( 6/ 8), 6.803: ~210 levels ~1966080 states ~4443176 transitions
pins2lts-mc-linux64( 6/ 8), 14.593: ~210 levels ~3932160 states ~9474984 transitions
pins2lts-mc-linux64( 6/ 8), 27.614: ~210 levels ~7864320 states ~19320024 transitions
pins2lts-mc-linux64( 6/ 8), 57.944: ~210 levels ~15728640 states ~40199776 transitions
pins2lts-mc-linux64( 6/ 8), 120.738: ~210 levels ~31457280 states ~81947704 transitions
pins2lts-mc-linux64( 6/ 8), 253.275: ~210 levels ~62914560 states ~170632184 transitions
pins2lts-mc-linux64( 6/ 8), 527.268: ~210 levels ~125829120 states ~357262976 transitions
pins2lts-mc-linux64( 4/ 8), 618.145: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 618.168:
pins2lts-mc-linux64( 0/ 8), 618.168: mean standard work distribution: 4.2% (states) 8.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 618.168:
pins2lts-mc-linux64( 0/ 8), 618.168: Explored 134204992 states 381743196 transitions, fanout: 2.844
pins2lts-mc-linux64( 0/ 8), 618.168: Total exploration time 618.060 sec (618.000 sec minimum, 618.029 sec on average)
pins2lts-mc-linux64( 0/ 8), 618.168: States per second: 217139, Transitions per second: 617648
pins2lts-mc-linux64( 0/ 8), 618.168:
pins2lts-mc-linux64( 0/ 8), 618.168: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 618.168: Redundant explorations: -0.0092
pins2lts-mc-linux64( 0/ 8), 618.168:
pins2lts-mc-linux64( 0/ 8), 618.168: Queue width: 8B, total height: 1735, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 618.168: Tree memory: 1029.6MB, 8.0 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 618.168: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 618.168: Stored 123 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 618.168: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 618.168: Est. total memory use: 1029.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7630382289900915906]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-15 06:54:31] [INFO ] Applying decomposition
[2021-05-15 06:54:31] [INFO ] Flatten gal took : 7 ms
[2021-05-15 06:54:31] [INFO ] Decomposing Gal with order
[2021-05-15 06:54:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:54:31] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-15 06:54:31] [INFO ] Flatten gal took : 13 ms
[2021-05-15 06:54:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 2 ms.
[2021-05-15 06:54:31] [INFO ] Time to serialize gal into /tmp/LTLFireability6730747425689898534.gal : 2 ms
[2021-05-15 06:54:31] [INFO ] Time to serialize properties into /tmp/LTLFireability6659039455648764650.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/LTLFireability6730747425689898534.gal, -t, CGAL, -LTL, /tmp/LTLFireability6659039455648764650.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6730747425689898534.gal -t CGAL -LTL /tmp/LTLFireability6659039455648764650.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X((F("(u50.p121!=1)"))&&(F("((u50.p121==1)||((u18.p39==1)&&(u26.p60==1)))")))))
Formula 0 simplified : !X(F"(u50.p121!=1)" & F"((u50.p121==1)||((u18.p39==1)&&(u26.p60==1)))")
Reverse transition relation is NOT exact ! Due to transitions t48, t50, t59, t61, t63, t65, t75, t76, t79, t81, t88, t92, t94, t95, t103, t107, t109, t110, t119, t121, u8.t1, u8.t2, u10.t3, u10.t4, u11.t5, u11.t6, u18.t8, u18.t9, u20.t10, u20.t11, u21.t12, u21.t13, u28.t15, u28.t16, u30.t17, u30.t18, u31.t19, u31.t20, u38.t22, u38.t23, u40.t24, u40.t25, u41.t26, u41.t27, u48.t29, u48.t30, u48.t37, u50.t31, u50.t32, u51.t33, u51.t34, i2.t0, i10.t7, i18.t14, i26.t21, i34.t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/56/83
Computing Next relation with stutter on 136620 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
61850 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,618.52,3345056,1,0,6.7944e+06,196,663,1.38412e+07,75,377,6200321
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-005A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X((!("(((u36.p86==1)&&(u38.p92==1))&&(u41.p102==1))"))&&(G(F(!("(((u47.p113==1)&&(u50.p123==1))&&(u51.p125==1))"))))))))
Formula 1 simplified : !XX(!"(((u36.p86==1)&&(u38.p92==1))&&(u41.p102==1))" & GF!"(((u47.p113==1)&&(u50.p123==1))&&(u51.p125==1))")
Computing Next relation with stutter on 136620 deadlock states
Detected timeout of ITS tools.
[2021-05-15 07:15:18] [INFO ] Flatten gal took : 7 ms
[2021-05-15 07:15:18] [INFO ] Input system was already deterministic with 123 transitions.
[2021-05-15 07:15:18] [INFO ] Transformed 128 places.
[2021-05-15 07:15:18] [INFO ] Transformed 123 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 07:15:18] [INFO ] Time to serialize gal into /tmp/LTLFireability18049814312037156890.gal : 1 ms
[2021-05-15 07:15:18] [INFO ] Time to serialize properties into /tmp/LTLFireability4084254665190478854.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/LTLFireability18049814312037156890.gal, -t, CGAL, -LTL, /tmp/LTLFireability4084254665190478854.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability18049814312037156890.gal -t CGAL -LTL /tmp/LTLFireability4084254665190478854.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((!("(((p86==1)&&(p92==1))&&(p102==1))"))&&(G(F(!("(((p113==1)&&(p123==1))&&(p125==1))"))))))))
Formula 0 simplified : !XX(!"(((p86==1)&&(p92==1))&&(p102==1))" & GF!"(((p113==1)&&(p123==1))&&(p125==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldIIPs-PT-005A"
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 ShieldIIPs-PT-005A, 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-162098204800229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005A.tgz
mv ShieldIIPs-PT-005A 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 ;