fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025100396
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldPPPs-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16198.567 3600000.00 14275153.00 443.50 FFFTFFTFFF?FFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025100396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 8.0K Apr 30 03:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 03:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 03:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 52K May 10 09:34 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 ShieldPPPs-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652976676730

Running Version 202205111006
[2022-05-19 16:11:17] [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]
[2022-05-19 16:11:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 16:11:18] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-05-19 16:11:18] [INFO ] Transformed 207 places.
[2022-05-19 16:11:18] [INFO ] Transformed 192 transitions.
[2022-05-19 16:11:18] [INFO ] Found NUPN structural information;
[2022-05-19 16:11:18] [INFO ] Parsed PT model containing 207 places and 192 transitions in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
FORMULA ShieldPPPs-PT-003B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 189 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 189 transition count 174
Applied a total of 36 rules in 39 ms. Remains 189 /207 variables (removed 18) and now considering 174/192 (removed 18) transitions.
// Phase 1: matrix 174 rows 189 cols
[2022-05-19 16:11:18] [INFO ] Computed 34 place invariants in 14 ms
[2022-05-19 16:11:18] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 174 rows 189 cols
[2022-05-19 16:11:18] [INFO ] Computed 34 place invariants in 12 ms
[2022-05-19 16:11:18] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
// Phase 1: matrix 174 rows 189 cols
[2022-05-19 16:11:18] [INFO ] Computed 34 place invariants in 6 ms
[2022-05-19 16:11:18] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/207 places, 174/192 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/207 places, 174/192 transitions.
Support contains 19 out of 189 places after structural reductions.
[2022-05-19 16:11:18] [INFO ] Flatten gal took : 38 ms
[2022-05-19 16:11:19] [INFO ] Flatten gal took : 18 ms
[2022-05-19 16:11:19] [INFO ] Input system was already deterministic with 174 transitions.
Finished random walk after 8683 steps, including 15 resets, run visited all 17 properties in 121 ms. (steps per millisecond=71 )
Computed a total of 37 stabilizing places and 37 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (!F(!G(p2))&&p1))))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 188 transition count 152
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 167 transition count 152
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 167 transition count 137
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 152 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 149 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 149 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 149 transition count 133
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 80 place count 148 transition count 133
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 97 transition count 82
Applied a total of 180 rules in 52 ms. Remains 97 /189 variables (removed 92) and now considering 82/174 (removed 92) transitions.
// Phase 1: matrix 82 rows 97 cols
[2022-05-19 16:11:19] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:19] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 82 rows 97 cols
[2022-05-19 16:11:19] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-19 16:11:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 97 cols
[2022-05-19 16:11:19] [INFO ] Computed 34 place invariants in 5 ms
[2022-05-19 16:11:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/189 places, 82/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/189 places, 82/174 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s55 1)), p2:(EQ s65 1), p0:(AND (EQ s79 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 243 steps with 0 reset in 10 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-01 finished in 684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((((F(p0)||p1) U p2) U X(p3))) U p2))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 170
Applied a total of 8 rules in 13 ms. Remains 185 /189 variables (removed 4) and now considering 170/174 (removed 4) transitions.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:20] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:20] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:20] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:20] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:20] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:20] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 170/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/189 places, 170/174 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p2), false, (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}, { cond=(NOT p2), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s130 1), p1:(NEQ s120 1), p0:(AND (EQ s149 1) (EQ s182 1)), p3:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2832 steps with 71 reset in 28 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-02 finished in 789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G((F(!F(p0)) U X(p1)))))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 188 transition count 151
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 166 transition count 151
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 166 transition count 136
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 151 transition count 136
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 148 transition count 133
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 148 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 148 transition count 132
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 82 place count 147 transition count 132
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 180 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 96 transition count 81
Applied a total of 182 rules in 21 ms. Remains 96 /189 variables (removed 93) and now considering 81/174 (removed 93) transitions.
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:20] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:20] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:20] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-19 16:11:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-19 16:11:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:21] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:21] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 81/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/189 places, 81/174 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s82 1), p0:(EQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 424 reset in 298 ms.
Product exploration explored 100000 steps with 418 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 463 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 71 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 492 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:23] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:23] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2022-05-19 16:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:23] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-19 16:11:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2022-05-19 16:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:23] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-19 16:11:23] [INFO ] Computed and/alt/rep : 79/149/79 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 16:11:23] [INFO ] Added : 57 causal constraints over 12 iterations in 147 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:23] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:23] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:23] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:23] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-19 16:11:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:23] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 453 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 606 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 81 rows 96 cols
[2022-05-19 16:11:25] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 16:11:25] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2022-05-19 16:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-19 16:11:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 16:11:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2022-05-19 16:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 16:11:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-19 16:11:25] [INFO ] Computed and/alt/rep : 79/149/79 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 16:11:25] [INFO ] Added : 57 causal constraints over 12 iterations in 129 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 419 reset in 224 ms.
Product exploration explored 100000 steps with 420 reset in 225 ms.
Built C files in :
/tmp/ltsmin12094739546048200447
[2022-05-19 16:11:26] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2022-05-19 16:11:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:26] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2022-05-19 16:11:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:26] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2022-05-19 16:11:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:26] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12094739546048200447
Running compilation step : cd /tmp/ltsmin12094739546048200447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin12094739546048200447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12094739546048200447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9318123963661566735.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLFireability-05 finished in 5838 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p1))&&p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 170
Applied a total of 8 rules in 5 ms. Remains 185 /189 variables (removed 4) and now considering 170/174 (removed 4) transitions.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:26] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:11:26] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:27] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 170/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/189 places, 170/174 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s73 1) (EQ s153 1)), p1:(EQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-07 finished in 436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((G(X(F(p0)))||p1))))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 188 transition count 152
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 167 transition count 152
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 167 transition count 137
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 152 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 149 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 149 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 78 place count 149 transition count 133
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 80 place count 148 transition count 133
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 182 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 95 transition count 80
Applied a total of 184 rules in 26 ms. Remains 95 /189 variables (removed 94) and now considering 80/174 (removed 94) transitions.
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:27] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-19 16:11:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:27] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:27] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 80/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/189 places, 80/174 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s55 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1734 reset in 226 ms.
Product exploration explored 100000 steps with 1679 reset in 261 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/95 stabilizing places and 2/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:28] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:28] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:28] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:11:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-19 16:11:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:28] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 80/80 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/95 stabilizing places and 2/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1629 reset in 191 ms.
Product exploration explored 100000 steps with 1738 reset in 257 ms.
Built C files in :
/tmp/ltsmin4357626440844922542
[2022-05-19 16:11:29] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-19 16:11:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:29] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-19 16:11:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:29] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-19 16:11:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4357626440844922542
Running compilation step : cd /tmp/ltsmin4357626440844922542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin4357626440844922542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4357626440844922542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3207601009682246227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:44] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 16:11:44] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:44] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:45] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-05-19 16:11:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 95 cols
[2022-05-19 16:11:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:11:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/95 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin2305964997424749695
[2022-05-19 16:11:45] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-19 16:11:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:45] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-19 16:11:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:45] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-19 16:11:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:11:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2305964997424749695
Running compilation step : cd /tmp/ltsmin2305964997424749695;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin2305964997424749695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2305964997424749695;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8939912470261179922.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 16:12:00] [INFO ] Flatten gal took : 7 ms
[2022-05-19 16:12:00] [INFO ] Flatten gal took : 7 ms
[2022-05-19 16:12:00] [INFO ] Time to serialize gal into /tmp/LTL4412049041826939413.gal : 12 ms
[2022-05-19 16:12:00] [INFO ] Time to serialize properties into /tmp/LTL11433654316877772367.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4412049041826939413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11433654316877772367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4412049...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((G(X(F("(p58==1)"))))||("(p114==0)")))))))
Formula 0 simplified : !XFGF("(p114==0)" | GXF"(p58==1)")
Detected timeout of ITS tools.
[2022-05-19 16:12:15] [INFO ] Flatten gal took : 6 ms
[2022-05-19 16:12:15] [INFO ] Applying decomposition
[2022-05-19 16:12:15] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8383258053094008740.txt' '-o' '/tmp/graph8383258053094008740.bin' '-w' '/tmp/graph8383258053094008740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8383258053094008740.bin' '-l' '-1' '-v' '-w' '/tmp/graph8383258053094008740.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:12:15] [INFO ] Decomposing Gal with order
[2022-05-19 16:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:12:15] [INFO ] Removed a total of 19 redundant transitions.
[2022-05-19 16:12:15] [INFO ] Flatten gal took : 52 ms
[2022-05-19 16:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2022-05-19 16:12:15] [INFO ] Time to serialize gal into /tmp/LTL10470417716286107537.gal : 4 ms
[2022-05-19 16:12:15] [INFO ] Time to serialize properties into /tmp/LTL7838791549789614442.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10470417716286107537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7838791549789614442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1047041...246
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((G(X(F("(i2.u10.p58==1)"))))||("(i3.u20.p114==0)")))))))
Formula 0 simplified : !XFGF("(i3.u20.p114==0)" | GXF"(i2.u10.p58==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2039494870954879974
[2022-05-19 16:12:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2039494870954879974
Running compilation step : cd /tmp/ltsmin2039494870954879974;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 173 ms.
Running link step : cd /tmp/ltsmin2039494870954879974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2039494870954879974;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](<>(([](X(<>((LTLAPp0==true))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-10 finished in 78518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U !p0))))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 188 transition count 151
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 166 transition count 151
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 166 transition count 136
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 151 transition count 136
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 148 transition count 133
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 148 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 80 place count 148 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 146 transition count 131
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 184 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 94 transition count 79
Applied a total of 186 rules in 24 ms. Remains 94 /189 variables (removed 95) and now considering 79/174 (removed 95) transitions.
// Phase 1: matrix 79 rows 94 cols
[2022-05-19 16:12:45] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:12:45] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 79 rows 94 cols
[2022-05-19 16:12:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:12:45] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-19 16:12:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 94 cols
[2022-05-19 16:12:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:12:45] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/189 places, 79/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 94/189 places, 79/174 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s59 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 187 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-11 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0))) U X(p1)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 170
Applied a total of 8 rules in 7 ms. Remains 185 /189 variables (removed 4) and now considering 170/174 (removed 4) transitions.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:45] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-19 16:12:46] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:46] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:12:46] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:46] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:12:46] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 170/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/189 places, 170/174 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s71 1), p0:(NEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 179 reset in 255 ms.
Stack based approach found an accepted trace after 43148 steps with 76 reset with depth 546 and stack size 106 in 118 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-12 finished in 802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 170
Applied a total of 8 rules in 6 ms. Remains 185 /189 variables (removed 4) and now considering 170/174 (removed 4) transitions.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:46] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:12:46] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:46] [INFO ] Computed 34 place invariants in 5 ms
[2022-05-19 16:12:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 185 cols
[2022-05-19 16:12:46] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 16:12:47] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 170/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/189 places, 170/174 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-13 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((G(X(F(p0)))||p1))))))'
[2022-05-19 16:12:47] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16957676300628691385
[2022-05-19 16:12:47] [INFO ] Computing symmetric may disable matrix : 174 transitions.
[2022-05-19 16:12:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:12:47] [INFO ] Computing symmetric may enable matrix : 174 transitions.
[2022-05-19 16:12:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:12:47] [INFO ] Applying decomposition
[2022-05-19 16:12:47] [INFO ] Computing Do-Not-Accords matrix : 174 transitions.
[2022-05-19 16:12:47] [INFO ] Flatten gal took : 9 ms
[2022-05-19 16:12:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 16:12:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16957676300628691385
Running compilation step : cd /tmp/ltsmin16957676300628691385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17863224301462519399.txt' '-o' '/tmp/graph17863224301462519399.bin' '-w' '/tmp/graph17863224301462519399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17863224301462519399.bin' '-l' '-1' '-v' '-w' '/tmp/graph17863224301462519399.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:12:47] [INFO ] Decomposing Gal with order
[2022-05-19 16:12:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:12:47] [INFO ] Removed a total of 27 redundant transitions.
[2022-05-19 16:12:47] [INFO ] Flatten gal took : 42 ms
[2022-05-19 16:12:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-19 16:12:47] [INFO ] Time to serialize gal into /tmp/LTLFireability18158558931414872037.gal : 12 ms
[2022-05-19 16:12:47] [INFO ] Time to serialize properties into /tmp/LTLFireability6678996990867993178.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18158558931414872037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6678996990867993178.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((G(X(F("(i4.i1.u21.p58==1)"))))||("(i5.i2.u39.p114==0)")))))))
Formula 0 simplified : !XFGF("(i5.i2.u39.p114==0)" | GXF"(i4.i1.u21.p58==1)")
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin16957676300628691385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16957676300628691385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([](<>(([](X(<>((LTLAPp0==true))))||(LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t55, t58, t61, t83, t86, t110, t113, t116, i0.u1.t120, i1.i1.u6.t119, i2.i0.u7.t118, i2.i1.u1...1006
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2022-05-19 16:33:16] [INFO ] Applying decomposition
[2022-05-19 16:33:16] [INFO ] Flatten gal took : 8 ms
[2022-05-19 16:33:16] [INFO ] Decomposing Gal with order
[2022-05-19 16:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:33:16] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 16:33:16] [INFO ] Flatten gal took : 49 ms
[2022-05-19 16:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 26 ms.
[2022-05-19 16:33:16] [INFO ] Time to serialize gal into /tmp/LTLFireability13674972601384636496.gal : 5 ms
[2022-05-19 16:33:16] [INFO ] Time to serialize properties into /tmp/LTLFireability3856127208554557174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13674972601384636496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3856127208554557174.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F((G(X(F("(i0.i0.i1.i0.u23.p58==1)"))))||("(i0.i1.i0.i0.i0.u42.p114==0)")))))))
Formula 0 simplified : !XFGF("(i0.i1.i0.i0.i0.u42.p114==0)" | GXF"(i0.i0.i1.i0.u23.p58==1)")
Detected timeout of ITS tools.
[2022-05-19 16:53:47] [INFO ] Flatten gal took : 105 ms
[2022-05-19 16:53:47] [INFO ] Input system was already deterministic with 174 transitions.
[2022-05-19 16:53:47] [INFO ] Transformed 189 places.
[2022-05-19 16:53:47] [INFO ] Transformed 174 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 16:53:47] [INFO ] Time to serialize gal into /tmp/LTLFireability17654763813399889674.gal : 8 ms
[2022-05-19 16:53:47] [INFO ] Time to serialize properties into /tmp/LTLFireability3869225698062028490.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17654763813399889674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3869225698062028490.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(G(F((G(X(F("(p58==1)"))))||("(p114==0)")))))))
Formula 0 simplified : !XFGF("(p114==0)" | GXF"(p58==1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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 r222-tall-165286025100396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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