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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 27K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.6K 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 82K 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-005B-00
FORMULA_NAME ShieldIIPs-PT-005B-01
FORMULA_NAME ShieldIIPs-PT-005B-02
FORMULA_NAME ShieldIIPs-PT-005B-03
FORMULA_NAME ShieldIIPs-PT-005B-04
FORMULA_NAME ShieldIIPs-PT-005B-05
FORMULA_NAME ShieldIIPs-PT-005B-06
FORMULA_NAME ShieldIIPs-PT-005B-07
FORMULA_NAME ShieldIIPs-PT-005B-08
FORMULA_NAME ShieldIIPs-PT-005B-09
FORMULA_NAME ShieldIIPs-PT-005B-10
FORMULA_NAME ShieldIIPs-PT-005B-11
FORMULA_NAME ShieldIIPs-PT-005B-12
FORMULA_NAME ShieldIIPs-PT-005B-13
FORMULA_NAME ShieldIIPs-PT-005B-14
FORMULA_NAME ShieldIIPs-PT-005B-15

=== Now, execution of the tool begins

BK_START 1621062257968

Running Version 0
[2021-05-15 07:04:19] [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 07:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 07:04:19] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-15 07:04:19] [INFO ] Transformed 303 places.
[2021-05-15 07:04:19] [INFO ] Transformed 298 transitions.
[2021-05-15 07:04:19] [INFO ] Found NUPN structural information;
[2021-05-15 07:04:19] [INFO ] Parsed PT model containing 303 places and 298 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 07:04:19] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldIIPs-PT-005B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 303 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 270 transition count 265
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 270 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 269 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 269 transition count 264
Applied a total of 68 rules in 81 ms. Remains 269 /303 variables (removed 34) and now considering 264/298 (removed 34) transitions.
// Phase 1: matrix 264 rows 269 cols
[2021-05-15 07:04:20] [INFO ] Computed 46 place invariants in 20 ms
[2021-05-15 07:04:20] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 264 rows 269 cols
[2021-05-15 07:04:20] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-15 07:04:20] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 269 cols
[2021-05-15 07:04:20] [INFO ] Computed 46 place invariants in 4 ms
[2021-05-15 07:04:20] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/303 places, 264/298 transitions.
[2021-05-15 07:04:20] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-15 07:04:20] [INFO ] Flatten gal took : 87 ms
FORMULA ShieldIIPs-PT-005B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 07:04:20] [INFO ] Flatten gal took : 24 ms
[2021-05-15 07:04:21] [INFO ] Input system was already deterministic with 264 transitions.
Finished random walk after 9074 steps, including 13 resets, run visited all 19 properties in 117 ms. (steps per millisecond=77 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 268 transition count 239
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 244 transition count 239
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 244 transition count 213
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 218 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 216 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 216 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 216 transition count 210
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 215 transition count 210
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 274 place count 131 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 129 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 277 place count 128 transition count 124
Applied a total of 277 rules in 73 ms. Remains 128 /269 variables (removed 141) and now considering 124/264 (removed 140) transitions.
// Phase 1: matrix 124 rows 128 cols
[2021-05-15 07:04:22] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:04:22] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 124 rows 128 cols
[2021-05-15 07:04:22] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:04:23] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2021-05-15 07:04:23] [INFO ] Redundant transitions in 16 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[123]
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 07:04:23] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:04:23] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 128/269 places, 123/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2021-05-15 07:04:23] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 123 rows 128 cols
[2021-05-15 07:04:23] [INFO ] Computed 45 place invariants in 4 ms
[2021-05-15 07:04:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 128/269 places, 123/264 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1 1), p0:(AND (EQ s37 1) (EQ s44 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 10 ms.
FORMULA ShieldIIPs-PT-005B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-01 finished in 2264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 262
Applied a total of 4 rules in 11 ms. Remains 267 /269 variables (removed 2) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:23] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:04:23] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:23] [INFO ] Computed 46 place invariants in 14 ms
[2021-05-15 07:04:23] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:23] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:04:23] [INFO ] Dead Transitions using invariants and state equation in 136 ms returned []
Finished structural reductions, in 1 iterations. Remains : 267/269 places, 262/264 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-005B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s222 1), p2:(AND (EQ s95 0) (EQ s222 1)), p1:(EQ s95 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-03 finished in 545 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&((p1 U ((p1&&G(p2))||G(p1))) U (G(p1)||(!p0&&(p1 U ((p1&&G(p2))||G(p1)))&&X(G((!p0||G(p3))))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 262
Applied a total of 4 rules in 19 ms. Remains 267 /269 variables (removed 2) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:04:24] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:04:24] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:04:24] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:04:24] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 267/269 places, 262/264 transitions.
Stuttering acceptance computed with spot in 2435 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3) (NOT p0)), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND p0 (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-005B-04 automaton TGBA [mat=[[{ cond=(AND p0 p1 p2 p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 10}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p2 p3), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0} source=4 dest: 8}], [{ cond=(AND p0 p1 p2 p3), acceptance={0} source=5 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={0} source=5 dest: 8}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=5 dest: 9}], [{ cond=(OR (AND p0 (NOT p3)) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p2 p3), acceptance={0} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND p0 p1 p2 p3), acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 10}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND p2 p3), acceptance={} source=9 dest: 9}], [{ cond=(AND p0 p1 p2 p3), acceptance={} source=10 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=10 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=10 dest: 11}], [{ cond=(OR (AND p0 (NOT p3)) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p0 p2 p3), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 11}]], initial=1, aps=[p0:(EQ s73 1), p1:(NEQ s106 1), p2:(OR (NEQ s83 1) (NEQ s101 1) (NEQ s110 1)), p3:(NEQ s213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 205 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-04 finished in 2952 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 268 transition count 239
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 244 transition count 239
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 244 transition count 213
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 218 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 216 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 216 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 216 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 215 transition count 210
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 15 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 278 place count 129 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 128 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 127 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 126 transition count 122
Applied a total of 281 rules in 122 ms. Remains 126 /269 variables (removed 143) and now considering 122/264 (removed 142) transitions.
// Phase 1: matrix 122 rows 126 cols
[2021-05-15 07:04:27] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:04:27] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 122 rows 126 cols
[2021-05-15 07:04:27] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:04:27] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2021-05-15 07:04:27] [INFO ] Redundant transitions in 13 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[121]
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 07:04:27] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:04:27] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 126/269 places, 121/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2021-05-15 07:04:27] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 121 rows 126 cols
[2021-05-15 07:04:27] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:04:27] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 126/269 places, 121/264 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s64 0) (EQ s73 0) (EQ s77 0)), p0:(AND (EQ s12 1) (EQ s23 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 345 reset in 349 ms.
Product exploration explored 100000 steps with 350 reset in 376 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 350 reset in 285 ms.
Product exploration explored 100000 steps with 345 reset in 288 ms.
[2021-05-15 07:04:29] [INFO ] Flatten gal took : 11 ms
[2021-05-15 07:04:29] [INFO ] Flatten gal took : 10 ms
[2021-05-15 07:04:29] [INFO ] Time to serialize gal into /tmp/LTL12951558705705746147.gal : 7 ms
[2021-05-15 07:04:29] [INFO ] Time to serialize properties into /tmp/LTL12927484916742280259.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/LTL12951558705705746147.gal, -t, CGAL, -LTL, /tmp/LTL12927484916742280259.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/LTL12951558705705746147.gal -t CGAL -LTL /tmp/LTL12927484916742280259.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((p31==1)&&(p53==1))&&(p64==1))")U("(((p149==0)||(p168==0))||(p179==0))")))))
Formula 0 simplified : !FG("(((p31==1)&&(p53==1))&&(p64==1))" U "(((p149==0)||(p168==0))||(p179==0))")
Detected timeout of ITS tools.
[2021-05-15 07:04:44] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:04:44] [INFO ] Applying decomposition
[2021-05-15 07:04:44] [INFO ] Flatten gal took : 9 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/graph9359123848387264298.txt, -o, /tmp/graph9359123848387264298.bin, -w, /tmp/graph9359123848387264298.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/graph9359123848387264298.bin, -l, -1, -v, -w, /tmp/graph9359123848387264298.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:04:49] [INFO ] Decomposing Gal with order
[2021-05-15 07:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:04:49] [INFO ] Removed a total of 80 redundant transitions.
[2021-05-15 07:04:49] [INFO ] Flatten gal took : 51 ms
[2021-05-15 07:04:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2021-05-15 07:04:49] [INFO ] Time to serialize gal into /tmp/LTL2092072533673697431.gal : 4 ms
[2021-05-15 07:04:49] [INFO ] Time to serialize properties into /tmp/LTL6993794901967029219.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/LTL2092072533673697431.gal, -t, CGAL, -LTL, /tmp/LTL6993794901967029219.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/LTL2092072533673697431.gal -t CGAL -LTL /tmp/LTL6993794901967029219.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i0.i1.u5.p31==1)&&(i0.i1.u9.p53==1))&&(i0.i2.u10.p64==1))")U("(((i2.i1.u25.p149==0)||(i2.i1.u28.p168==0))||(i2.i1.u29.p179==0))")))))
Formula 0 simplified : !FG("(((i0.i1.u5.p31==1)&&(i0.i1.u9.p53==1))&&(i0.i2.u10.p64==1))" U "(((i2.i1.u25.p149==0)||(i2.i1.u28.p168==0))||(i2.i1.u29.p179==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5424484978283527919
[2021-05-15 07:05:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5424484978283527919
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/ltsmin5424484978283527919]
Compilation finished in 597 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5424484978283527919]
Link finished in 37 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, <>([](((LTLAPp0==true) U (LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5424484978283527919]
LTSmin run took 376 ms.
FORMULA ShieldIIPs-PT-005B-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-05 finished in 38781 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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 268 transition count 237
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 242 transition count 237
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 242 transition count 212
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 217 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 215 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 215 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 215 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 214 transition count 209
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 280 place count 128 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 126 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 125 transition count 121
Applied a total of 283 rules in 30 ms. Remains 125 /269 variables (removed 144) and now considering 121/264 (removed 143) transitions.
// Phase 1: matrix 121 rows 125 cols
[2021-05-15 07:05:05] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:05:05] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 121 rows 125 cols
[2021-05-15 07:05:05] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:05:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2021-05-15 07:05:05] [INFO ] Redundant transitions in 13 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[120]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 07:05:05] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 125/269 places, 120/264 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 07:05:06] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 07:05:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/269 places, 120/264 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s103 1) (EQ s116 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 1 ms.
FORMULA ShieldIIPs-PT-005B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-07 finished in 412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 268 transition count 237
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 242 transition count 237
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 242 transition count 211
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 216 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 215 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 215 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 215 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 214 transition count 209
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 280 place count 128 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 126 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 125 transition count 121
Applied a total of 283 rules in 26 ms. Remains 125 /269 variables (removed 144) and now considering 121/264 (removed 143) transitions.
// Phase 1: matrix 121 rows 125 cols
[2021-05-15 07:05:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 121 rows 125 cols
[2021-05-15 07:05:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2021-05-15 07:05:06] [INFO ] Redundant transitions in 15 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[120]
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 07:05:06] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 125/269 places, 120/264 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 07:05:06] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 120 rows 125 cols
[2021-05-15 07:05:06] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/269 places, 120/264 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 640 steps with 2 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-09 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)||(p0&&(p1 U p2))) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 262
Applied a total of 4 rules in 4 ms. Remains 267 /269 variables (removed 2) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:06] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:06] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:06] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:06] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 267/269 places, 262/264 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s127 0) (EQ s129 0)), p2:(EQ s36 1), p1:(OR (AND (EQ s127 1) (EQ s129 1)) (EQ s246 1)), p3:(EQ s246 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33381 reset in 308 ms.
Product exploration explored 100000 steps with 33145 reset in 272 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1), (NOT p3)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2)]
Product exploration explored 100000 steps with 33402 reset in 241 ms.
Product exploration explored 100000 steps with 33250 reset in 249 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2)]
Support contains 4 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 267/267 places, 262/262 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 262
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 267 transition count 265
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 267 transition count 265
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 139 place count 267 transition count 265
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 172 place count 234 transition count 232
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 205 place count 234 transition count 232
Deduced a syphon composed of 106 places in 0 ms
Applied a total of 205 rules in 32 ms. Remains 234 /267 variables (removed 33) and now considering 232/262 (removed 30) transitions.
[2021-05-15 07:05:17] [INFO ] Redundant transitions in 14 ms returned [231]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[231]
// Phase 1: matrix 231 rows 234 cols
[2021-05-15 07:05:17] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-15 07:05:17] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Starting structural reductions, iteration 1 : 234/267 places, 231/262 transitions.
Deduced a syphon composed of 106 places in 1 ms
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2021-05-15 07:05:17] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 231 rows 234 cols
[2021-05-15 07:05:17] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:17] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 234/267 places, 231/262 transitions.
Product exploration explored 100000 steps with 33323 reset in 963 ms.
Product exploration explored 100000 steps with 33326 reset in 759 ms.
[2021-05-15 07:05:19] [INFO ] Flatten gal took : 14 ms
[2021-05-15 07:05:19] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:05:19] [INFO ] Time to serialize gal into /tmp/LTL14355022500823656702.gal : 2 ms
[2021-05-15 07:05:19] [INFO ] Time to serialize properties into /tmp/LTL17717600345571663742.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/LTL14355022500823656702.gal, -t, CGAL, -LTL, /tmp/LTL17717600345571663742.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/LTL14355022500823656702.gal -t CGAL -LTL /tmp/LTL17717600345571663742.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("((p141==0)||(p143==0))"))||((("(((p141==1)&&(p143==1))||(p276==1))")U("(p36==1)"))&&("((p141==0)||(p143==0))")))U(X("(p276==1)"))))
Formula 0 simplified : !((X"((p141==0)||(p143==0))" | ("((p141==0)||(p143==0))" & ("(((p141==1)&&(p143==1))||(p276==1))" U "(p36==1)"))) U X"(p276==1)")
Detected timeout of ITS tools.
[2021-05-15 07:05:34] [INFO ] Flatten gal took : 12 ms
[2021-05-15 07:05:34] [INFO ] Applying decomposition
[2021-05-15 07:05:34] [INFO ] Flatten gal took : 12 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/graph6185337421987524322.txt, -o, /tmp/graph6185337421987524322.bin, -w, /tmp/graph6185337421987524322.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/graph6185337421987524322.bin, -l, -1, -v, -w, /tmp/graph6185337421987524322.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:05:34] [INFO ] Decomposing Gal with order
[2021-05-15 07:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:05:34] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-15 07:05:34] [INFO ] Flatten gal took : 56 ms
[2021-05-15 07:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-15 07:05:34] [INFO ] Time to serialize gal into /tmp/LTL11193309954628578948.gal : 13 ms
[2021-05-15 07:05:34] [INFO ] Time to serialize properties into /tmp/LTL9744194538782202147.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/LTL11193309954628578948.gal, -t, CGAL, -LTL, /tmp/LTL9744194538782202147.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/LTL11193309954628578948.gal -t CGAL -LTL /tmp/LTL9744194538782202147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((X("((i5.i2.u48.p141==0)||(i5.i2.u49.p143==0))"))||((("(((i5.i2.u48.p141==1)&&(i5.i2.u49.p143==1))||(i10.i0.u93.p276==1))")U("(i0.i2.u14.p36==1)"))&&("((i5.i2.u48.p141==0)||(i5.i2.u49.p143==0))")))U(X("(i10.i0.u93.p276==1)"))))
Formula 0 simplified : !((X"((i5.i2.u48.p141==0)||(i5.i2.u49.p143==0))" | ("((i5.i2.u48.p141==0)||(i5.i2.u49.p143==0))" & ("(((i5.i2.u48.p141==1)&&(i5.i2.u49.p143==1))||(i10.i0.u93.p276==1))" U "(i0.i2.u14.p36==1)"))) U X"(i10.i0.u93.p276==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12713942929152688034
[2021-05-15 07:05:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12713942929152688034
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/ltsmin12713942929152688034]
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/ltsmin12713942929152688034] 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/ltsmin12713942929152688034] 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-005B-11 finished in 43935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 267 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 267 transition count 262
Applied a total of 4 rules in 9 ms. Remains 267 /269 variables (removed 2) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:50] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:50] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:50] [INFO ] Computed 46 place invariants in 6 ms
[2021-05-15 07:05:50] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 267 cols
[2021-05-15 07:05:50] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:50] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 267/269 places, 262/264 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Product exploration explored 100000 steps with 33333 reset in 196 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 267/267 places, 262/262 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 262
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 267 transition count 267
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 267 transition count 267
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 140 place count 267 transition count 267
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 175 place count 232 transition count 232
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 210 place count 232 transition count 232
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 210 rules in 22 ms. Remains 232 /267 variables (removed 35) and now considering 232/262 (removed 30) transitions.
[2021-05-15 07:05:52] [INFO ] Redundant transitions in 20 ms returned [231]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[231]
// Phase 1: matrix 231 rows 232 cols
[2021-05-15 07:05:52] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:52] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Starting structural reductions, iteration 1 : 232/267 places, 231/262 transitions.
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2021-05-15 07:05:52] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 231 rows 232 cols
[2021-05-15 07:05:52] [INFO ] Computed 46 place invariants in 1 ms
[2021-05-15 07:05:52] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 2 iterations. Remains : 232/267 places, 231/262 transitions.
Product exploration explored 100000 steps with 33333 reset in 734 ms.
Product exploration explored 100000 steps with 33333 reset in 735 ms.
[2021-05-15 07:05:53] [INFO ] Flatten gal took : 10 ms
[2021-05-15 07:05:53] [INFO ] Flatten gal took : 10 ms
[2021-05-15 07:05:53] [INFO ] Time to serialize gal into /tmp/LTL7624460091152090852.gal : 1 ms
[2021-05-15 07:05:53] [INFO ] Time to serialize properties into /tmp/LTL9253119491241505989.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/LTL7624460091152090852.gal, -t, CGAL, -LTL, /tmp/LTL9253119491241505989.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/LTL7624460091152090852.gal -t CGAL -LTL /tmp/LTL9253119491241505989.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p79!=1)")))))
Formula 0 simplified : !XXF"(p79!=1)"
Detected timeout of ITS tools.
[2021-05-15 07:06:08] [INFO ] Flatten gal took : 10 ms
[2021-05-15 07:06:08] [INFO ] Applying decomposition
[2021-05-15 07:06:08] [INFO ] Flatten gal took : 10 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/graph390414699535188075.txt, -o, /tmp/graph390414699535188075.bin, -w, /tmp/graph390414699535188075.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/graph390414699535188075.bin, -l, -1, -v, -w, /tmp/graph390414699535188075.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:06:08] [INFO ] Decomposing Gal with order
[2021-05-15 07:06:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:06:08] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-15 07:06:08] [INFO ] Flatten gal took : 26 ms
[2021-05-15 07:06:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-15 07:06:08] [INFO ] Time to serialize gal into /tmp/LTL16003262270912390970.gal : 5 ms
[2021-05-15 07:06:08] [INFO ] Time to serialize properties into /tmp/LTL9172806886610502113.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/LTL16003262270912390970.gal, -t, CGAL, -LTL, /tmp/LTL9172806886610502113.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/LTL16003262270912390970.gal -t CGAL -LTL /tmp/LTL9172806886610502113.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i2.u27.p79!=1)")))))
Formula 0 simplified : !XXF"(i2.u27.p79!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12577044843018214274
[2021-05-15 07:06:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12577044843018214274
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/ltsmin12577044843018214274]
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/ltsmin12577044843018214274] 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/ltsmin12577044843018214274] 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-005B-12 finished in 34501 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 268 transition count 237
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 242 transition count 237
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 242 transition count 211
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 216 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 214 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 214 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 108 place count 214 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 213 transition count 208
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 276 place count 130 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 128 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 127 transition count 123
Applied a total of 279 rules in 19 ms. Remains 127 /269 variables (removed 142) and now considering 123/264 (removed 141) transitions.
// Phase 1: matrix 123 rows 127 cols
[2021-05-15 07:06:25] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:06:25] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 123 rows 127 cols
[2021-05-15 07:06:25] [INFO ] Computed 45 place invariants in 1 ms
[2021-05-15 07:06:25] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2021-05-15 07:06:25] [INFO ] Redundant transitions in 9 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions :[122]
// Phase 1: matrix 122 rows 127 cols
[2021-05-15 07:06:25] [INFO ] Computed 45 place invariants in 0 ms
[2021-05-15 07:06:25] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 127/269 places, 122/264 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2021-05-15 07:06:25] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 122 rows 127 cols
[2021-05-15 07:06:25] [INFO ] Computed 45 place invariants in 5 ms
[2021-05-15 07:06:25] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 127/269 places, 122/264 transitions.
Stuttering acceptance computed with spot in 46 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-14 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s3 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 338 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-14 finished in 468 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2049801754126078977
[2021-05-15 07:06:25] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2021-05-15 07:06:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:06:25] [INFO ] Applying decomposition
[2021-05-15 07:06:25] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2021-05-15 07:06:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:06:25] [INFO ] Flatten gal took : 9 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/graph6696508077204125051.txt, -o, /tmp/graph6696508077204125051.bin, -w, /tmp/graph6696508077204125051.weights], workingDir=null]
[2021-05-15 07:06:25] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6696508077204125051.bin, -l, -1, -v, -w, /tmp/graph6696508077204125051.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 07:06:25] [INFO ] Decomposing Gal with order
[2021-05-15 07:06:25] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 07:06:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 07:06:25] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2049801754126078977
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/ltsmin2049801754126078977]
[2021-05-15 07:06:25] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-15 07:06:25] [INFO ] Flatten gal took : 17 ms
[2021-05-15 07:06:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-15 07:06:25] [INFO ] Time to serialize gal into /tmp/LTLFireability11053230778518443216.gal : 2 ms
[2021-05-15 07:06:25] [INFO ] Time to serialize properties into /tmp/LTLFireability6380075481294429849.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/LTLFireability11053230778518443216.gal, -t, CGAL, -LTL, /tmp/LTLFireability6380075481294429849.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/LTLFireability11053230778518443216.gal -t CGAL -LTL /tmp/LTLFireability6380075481294429849.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((((X("((i5.u48.p141==0)||(i5.u47.p143==0))"))||(("((i5.u48.p141==0)||(i5.u47.p143==0))")&&(("(((i5.u48.p141==1)&&(i5.u47.p143==1))||(i10.u91.p276==1))")U("(i1.u14.p36==1)"))))U(X("(i10.u91.p276==1)"))))
Formula 0 simplified : !((X"((i5.u48.p141==0)||(i5.u47.p143==0))" | ("((i5.u48.p141==0)||(i5.u47.p143==0))" & ("(((i5.u48.p141==1)&&(i5.u47.p143==1))||(i10.u91.p276==1))" U "(i1.u14.p36==1)"))) U X"(i10.u91.p276==1)")
Compilation finished in 1305 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2049801754126078977]
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))||((LTLAPp0==true)&&((LTLAPp1==true) U (LTLAPp2==true)))) U X((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2049801754126078977]
LTSmin run took 677 ms.
FORMULA ShieldIIPs-PT-005B-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin2049801754126078977]
LTSmin run took 712 ms.
FORMULA ShieldIIPs-PT-005B-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621062389421

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

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