Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713500396.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r389-oct2-167903713500396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K Mar 5 18:23 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 1679195011559

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 03:03:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 03:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:03:34] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-19 03:03:34] [INFO ] Transformed 207 places.
[2023-03-19 03:03:34] [INFO ] Transformed 192 transitions.
[2023-03-19 03:03:34] [INFO ] Found NUPN structural information;
[2023-03-19 03:03:34] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 214 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 3 formulas.
FORMULA ShieldPPPs-PT-003B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 192 transition count 177
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 192 transition count 177
Applied a total of 30 rules in 33 ms. Remains 192 /207 variables (removed 15) and now considering 177/192 (removed 15) transitions.
// Phase 1: matrix 177 rows 192 cols
[2023-03-19 03:03:34] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-19 03:03:35] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-19 03:03:35] [INFO ] Invariant cache hit.
[2023-03-19 03:03:35] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2023-03-19 03:03:35] [INFO ] Invariant cache hit.
[2023-03-19 03:03:36] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/207 places, 177/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 192/207 places, 177/192 transitions.
Support contains 39 out of 192 places after structural reductions.
[2023-03-19 03:03:36] [INFO ] Flatten gal took : 66 ms
[2023-03-19 03:03:36] [INFO ] Flatten gal took : 16 ms
[2023-03-19 03:03:36] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 03:03:36] [INFO ] Invariant cache hit.
[2023-03-19 03:03:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-19 03:03:36] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldPPPs-PT-003B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 39 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 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 191 transition count 154
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 169 transition count 154
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 169 transition count 139
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 74 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 148 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 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 86 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 90 place count 146 transition count 131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 186 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 188 place count 96 transition count 81
Applied a total of 188 rules in 67 ms. Remains 96 /192 variables (removed 96) and now considering 81/177 (removed 96) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-19 03:03:37] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:03:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 03:03:37] [INFO ] Invariant cache hit.
[2023-03-19 03:03:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-19 03:03:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:03:37] [INFO ] Invariant cache hit.
[2023-03-19 03:03:37] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/192 places, 81/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 96/192 places, 81/177 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s25 1)), p0:(AND (EQ s52 1) (EQ s74 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 1890 reset in 408 ms.
Product exploration explored 100000 steps with 1867 reset in 281 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 314 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 03:03:40] [INFO ] Invariant cache hit.
[2023-03-19 03:03:40] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-19 03:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:03:40] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-19 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:03:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-19 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:03:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-19 03:03:40] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-19 03:03:40] [INFO ] Added : 50 causal constraints over 10 iterations in 134 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 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.
[2023-03-19 03:03:40] [INFO ] Invariant cache hit.
[2023-03-19 03:03:40] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 03:03:40] [INFO ] Invariant cache hit.
[2023-03-19 03:03:40] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-19 03:03:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:03:40] [INFO ] Invariant cache hit.
[2023-03-19 03:03:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 315 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 443 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 03:03:42] [INFO ] Invariant cache hit.
[2023-03-19 03:03:42] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-19 03:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:03:42] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-19 03:03:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:03:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-19 03:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:03:42] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-19 03:03:42] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-19 03:03:42] [INFO ] Added : 50 causal constraints over 10 iterations in 211 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1842 reset in 220 ms.
Product exploration explored 100000 steps with 1841 reset in 211 ms.
Built C files in :
/tmp/ltsmin5853308435395938360
[2023-03-19 03:03:43] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-19 03:03:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:43] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-19 03:03:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:43] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-19 03:03:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5853308435395938360
Running compilation step : cd /tmp/ltsmin5853308435395938360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin5853308435395938360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin5853308435395938360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased436936088522442206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 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 5 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 03:03:58] [INFO ] Invariant cache hit.
[2023-03-19 03:03:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 03:03:58] [INFO ] Invariant cache hit.
[2023-03-19 03:03:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-19 03:03:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:03:58] [INFO ] Invariant cache hit.
[2023-03-19 03:03:58] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin6312434986809924613
[2023-03-19 03:03:58] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-19 03:03:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:58] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-19 03:03:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:58] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-19 03:03:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:03:58] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6312434986809924613
Running compilation step : cd /tmp/ltsmin6312434986809924613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin6312434986809924613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin6312434986809924613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4544785985931029331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:04:13] [INFO ] Flatten gal took : 10 ms
[2023-03-19 03:04:13] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:04:13] [INFO ] Time to serialize gal into /tmp/LTL459776018180026548.gal : 15 ms
[2023-03-19 03:04:13] [INFO ] Time to serialize properties into /tmp/LTL8073946468299820025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL459776018180026548.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17565319481330024675.hoa' '-atoms' '/tmp/LTL8073946468299820025.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8073946468299820025.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17565319481330024675.hoa
Detected timeout of ITS tools.
[2023-03-19 03:04:29] [INFO ] Flatten gal took : 5 ms
[2023-03-19 03:04:29] [INFO ] Flatten gal took : 4 ms
[2023-03-19 03:04:29] [INFO ] Time to serialize gal into /tmp/LTL9509682652925693217.gal : 2 ms
[2023-03-19 03:04:29] [INFO ] Time to serialize properties into /tmp/LTL11971461514128144916.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9509682652925693217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11971461514128144916.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p16==1)&&(p51==1))"))||("((p107==1)&&(p158==1))")))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
Detected timeout of ITS tools.
[2023-03-19 03:04:44] [INFO ] Flatten gal took : 14 ms
[2023-03-19 03:04:44] [INFO ] Applying decomposition
[2023-03-19 03:04:44] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14007316083899145514.txt' '-o' '/tmp/graph14007316083899145514.bin' '-w' '/tmp/graph14007316083899145514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14007316083899145514.bin' '-l' '-1' '-v' '-w' '/tmp/graph14007316083899145514.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:04:44] [INFO ] Decomposing Gal with order
[2023-03-19 03:04:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:04:44] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-19 03:04:44] [INFO ] Flatten gal took : 72 ms
[2023-03-19 03:04:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2023-03-19 03:04:44] [INFO ] Time to serialize gal into /tmp/LTL12811910949839656917.gal : 3 ms
[2023-03-19 03:04:44] [INFO ] Time to serialize properties into /tmp/LTL14906890275278241848.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12811910949839656917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14906890275278241848.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i2.u1.p16==1)&&(i2.u9.p51==1))"))||("((i6.u19.p107==1)&&(i8.i1.u26.p158==1))")))))
Formula 0 simplified : G(F!"((i2.u1.p16==1)&&(i2.u9.p51==1))" & FG!"((i6.u19.p107==1)&&(i8.i1.u26.p158==1))")
Reverse transition relation is NOT exact ! Due to transitions t0_t121, t1_t118, t2_t115, t13_t94, t14_t91, t15_t88, t26_t66, t27_t63, t28_t60_t124_t59, i0....754
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1365684212567201116
[2023-03-19 03:04:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1365684212567201116
Running compilation step : cd /tmp/ltsmin1365684212567201116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin1365684212567201116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1365684212567201116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((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-01 finished in 97297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||X(F((p1&&F(p2)))))) U p1))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 192 transition count 154
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 169 transition count 154
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 169 transition count 139
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 76 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 148 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 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 88 place count 148 transition count 131
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 146 transition count 131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 188 place count 98 transition count 83
Applied a total of 188 rules in 42 ms. Remains 98 /192 variables (removed 94) and now considering 83/177 (removed 94) transitions.
// Phase 1: matrix 83 rows 98 cols
[2023-03-19 03:05:14] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:05:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-19 03:05:14] [INFO ] Invariant cache hit.
[2023-03-19 03:05:14] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-19 03:05:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:05:14] [INFO ] Invariant cache hit.
[2023-03-19 03:05:15] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/192 places, 83/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 98/192 places, 83/177 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s4 1), p0:(OR (EQ s0 1) (EQ s60 1)), p2:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 250 steps with 3 reset in 4 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-02 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U X(p2))) U G(p0)) U X(!p3)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 186 transition count 171
Applied a total of 12 rules in 10 ms. Remains 186 /192 variables (removed 6) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-19 03:05:15] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:05:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-19 03:05:15] [INFO ] Invariant cache hit.
[2023-03-19 03:05:15] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-19 03:05:15] [INFO ] Invariant cache hit.
[2023-03-19 03:05:15] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/192 places, 171/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 186/192 places, 171/177 transitions.
Stuttering acceptance computed with spot in 411 ms :[p3, (AND (NOT p2) p3), p3, (AND p0 (NOT p2) p3), true, (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 5}, { cond=p3, acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s163 1), p1:(EQ s56 1), p2:(EQ s114 1), p3:(AND (EQ s163 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 17 factoid took 401 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-003B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-003B-LTLFireability-03 finished in 1623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))&&X(G(p2))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 27 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:05:17] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:05:17] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-19 03:05:17] [INFO ] Invariant cache hit.
[2023-03-19 03:05:17] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-19 03:05:17] [INFO ] Invariant cache hit.
[2023-03-19 03:05:17] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s138 1), p0:(EQ s161 1), p1:(EQ s138 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-05 finished in 919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U ((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(!p3&&(F(p1)||X(p2)))))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 188 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 187 transition count 172
Applied a total of 10 rules in 10 ms. Remains 187 /192 variables (removed 5) and now considering 172/177 (removed 5) transitions.
// Phase 1: matrix 172 rows 187 cols
[2023-03-19 03:05:17] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:05:18] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-19 03:05:18] [INFO ] Invariant cache hit.
[2023-03-19 03:05:19] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-03-19 03:05:19] [INFO ] Invariant cache hit.
[2023-03-19 03:05:19] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/192 places, 172/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1302 ms. Remains : 187/192 places, 172/177 transitions.
Stuttering acceptance computed with spot in 712 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=1 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={2} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=8 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=8 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s106 1), p0:(EQ s63 1), p3:(AND (EQ s91 1) (EQ s172 1)), p2:(EQ s166 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4664 reset in 181 ms.
Product exploration explored 100000 steps with 4718 reset in 206 ms.
Computed a total of 37 stabilizing places and 37 stable transitions
Computed a total of 37 stabilizing places and 37 stable transitions
Detected a total of 37/187 stabilizing places and 37/172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 5316 ms. Reduced automaton from 10 states, 52 edges and 4 AP (stutter sensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1476 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 16) seen :13
Finished Best-First random walk after 739 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=369 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 p0 (NOT p3))), (F (AND p0 p3)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p0) p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) p2 p0 p3)), (F (AND (NOT p1) p2 (NOT p0) p3)), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) p0 p3)), (F (AND (NOT p1) (NOT p2) p0 p3)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p0) p3)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p0) p3)), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))]
Knowledge based reduction with 25 factoid took 7571 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1566 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1381 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
[2023-03-19 03:05:38] [INFO ] Invariant cache hit.
[2023-03-19 03:05:38] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-19 03:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:05:38] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-19 03:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:05:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-19 03:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:05:38] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-19 03:05:38] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 11 ms to minimize.
[2023-03-19 03:05:39] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-19 03:05:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-19 03:05:39] [INFO ] Computed and/alt/rep : 171/301/171 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-19 03:05:40] [INFO ] Added : 171 causal constraints over 35 iterations in 1323 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 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 186 transition count 150
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 165 transition count 150
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 165 transition count 135
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 150 transition count 135
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 170 place count 101 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 99 transition count 84
Applied a total of 172 rules in 22 ms. Remains 99 /187 variables (removed 88) and now considering 84/172 (removed 88) transitions.
// Phase 1: matrix 84 rows 99 cols
[2023-03-19 03:05:40] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:05:40] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-19 03:05:40] [INFO ] Invariant cache hit.
[2023-03-19 03:05:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-19 03:05:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 03:05:40] [INFO ] Invariant cache hit.
[2023-03-19 03:05:40] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/187 places, 84/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 551 ms. Remains : 99/187 places, 84/172 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p2 p0 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p0 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (AND (NOT p1) p2 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 25 factoid took 7566 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 16) seen :13
Finished Best-First random walk after 194 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=194 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) p3))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p2 p0 p3))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p2 p0 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (AND (NOT p1) p2 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (AND p0 p2 (NOT p1) (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1) p3)), (F (AND (NOT p0) p2 (NOT p1) p3)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1) p3)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))]
Knowledge based reduction with 25 factoid took 9837 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1452 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
[2023-03-19 03:06:02] [INFO ] Invariant cache hit.
[2023-03-19 03:06:02] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-19 03:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:02] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-19 03:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:06:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-19 03:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:03] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-19 03:06:03] [INFO ] Computed and/alt/rep : 81/184/81 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-19 03:06:03] [INFO ] Added : 76 causal constraints over 16 iterations in 252 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 1462 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 16257 reset in 294 ms.
Product exploration explored 100000 steps with 16219 reset in 217 ms.
Built C files in :
/tmp/ltsmin14112181619443209593
[2023-03-19 03:06:05] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2023-03-19 03:06:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:06:05] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2023-03-19 03:06:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:06:05] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2023-03-19 03:06:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:06:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14112181619443209593
Running compilation step : cd /tmp/ltsmin14112181619443209593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin14112181619443209593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14112181619443209593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13781830312445335433.hoa' '--buchi-type=spotba'
LTSmin run took 374 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLFireability-06 finished in 48070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0 U (p1||G(p0))))&&(G(!p2)||(!p2&&F(p3)))))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 186 transition count 171
Applied a total of 12 rules in 14 ms. Remains 186 /192 variables (removed 6) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-19 03:06:06] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:06:06] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-19 03:06:06] [INFO ] Invariant cache hit.
[2023-03-19 03:06:06] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-19 03:06:06] [INFO ] Invariant cache hit.
[2023-03-19 03:06:06] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/192 places, 171/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 186/192 places, 171/177 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s174 1) (EQ s5 1) (EQ s24 1)), p3:(EQ s173 1), p1:(AND (NOT (AND (EQ s5 1) (EQ s24 1))) (NEQ s174 1)), p0:(NEQ s174 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 4026 steps with 29 reset in 13 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-07 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1) U p2)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 11 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:06:06] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:06:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-19 03:06:06] [INFO ] Invariant cache hit.
[2023-03-19 03:06:07] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-19 03:06:07] [INFO ] Invariant cache hit.
[2023-03-19 03:06:07] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s168 1), p1:(NEQ s54 1), p0:(AND (EQ s149 1) (EQ s183 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 7465 reset in 174 ms.
Product exploration explored 100000 steps with 7491 reset in 223 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 963 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Finished random walk after 1273 steps, including 2 resets, run visited all 6 properties in 23 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (AND (NOT p1) p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 12 factoid took 1073 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
[2023-03-19 03:06:11] [INFO ] Invariant cache hit.
[2023-03-19 03:06:11] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-19 03:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:11] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-19 03:06:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:06:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-19 03:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:11] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-19 03:06:11] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 26 ms to minimize.
[2023-03-19 03:06:12] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2023-03-19 03:06:12] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2023-03-19 03:06:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2023-03-19 03:06:12] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-19 03:06:12] [INFO ] Added : 134 causal constraints over 27 iterations in 786 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-19 03:06:12] [INFO ] Invariant cache hit.
[2023-03-19 03:06:13] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 03:06:13] [INFO ] Invariant cache hit.
[2023-03-19 03:06:13] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-19 03:06:13] [INFO ] Invariant cache hit.
[2023-03-19 03:06:13] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 816 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Finished random walk after 222 steps, including 0 resets, run visited all 6 properties in 18 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 1026 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
[2023-03-19 03:06:16] [INFO ] Invariant cache hit.
[2023-03-19 03:06:16] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-19 03:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:16] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-19 03:06:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:06:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-19 03:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:16] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-19 03:06:17] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2023-03-19 03:06:17] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2023-03-19 03:06:17] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-03-19 03:06:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 322 ms
[2023-03-19 03:06:17] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-19 03:06:18] [INFO ] Added : 134 causal constraints over 27 iterations in 888 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7521 reset in 163 ms.
Product exploration explored 100000 steps with 7442 reset in 169 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 87 place count 185 transition count 171
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 107 place count 165 transition count 151
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 127 place count 165 transition count 151
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 127 rules in 44 ms. Remains 165 /185 variables (removed 20) and now considering 151/170 (removed 19) transitions.
[2023-03-19 03:06:19] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 151 rows 165 cols
[2023-03-19 03:06:19] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-19 03:06:19] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/185 places, 151/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 165/185 places, 151/170 transitions.
Built C files in :
/tmp/ltsmin10819958335341769918
[2023-03-19 03:06:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10819958335341769918
Running compilation step : cd /tmp/ltsmin10819958335341769918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin10819958335341769918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin10819958335341769918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16051066703850241453.hoa' '--buchi-type=spotba'
LTSmin run took 13703 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLFireability-08 finished in 26984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(p1)) U (G((!p0||X(p1)))||((!p0||X(p1))&&G(!p1))))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 12 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:06:33] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:06:33] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 03:06:33] [INFO ] Invariant cache hit.
[2023-03-19 03:06:34] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-19 03:06:34] [INFO ] Invariant cache hit.
[2023-03-19 03:06:34] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), false, false, (NOT p1), p1]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(NEQ s92 1), p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 413 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-09 finished in 852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 191 transition count 156
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 171 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 170 transition count 155
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 42 place count 170 transition count 139
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 74 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 148 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 148 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 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 3 with 2 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 184 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 97 transition count 82
Applied a total of 186 rules in 53 ms. Remains 97 /192 variables (removed 95) and now considering 82/177 (removed 95) transitions.
// Phase 1: matrix 82 rows 97 cols
[2023-03-19 03:06:34] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-19 03:06:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-19 03:06:34] [INFO ] Invariant cache hit.
[2023-03-19 03:06:34] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-19 03:06:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:06:34] [INFO ] Invariant cache hit.
[2023-03-19 03:06:35] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/192 places, 82/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 97/192 places, 82/177 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s74 0) (EQ s76 0)) (OR (EQ s68 0) (EQ s85 0)) (OR (AND (EQ s78 1) (EQ s96 1)) (AND (EQ s68 1) (EQ s85 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 253 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 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 191 transition count 153
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 168 transition count 153
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 168 transition count 138
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 76 place count 153 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 147 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 147 transition count 130
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 92 place count 145 transition count 130
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 192 place count 95 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 93 transition count 78
Applied a total of 194 rules in 20 ms. Remains 93 /192 variables (removed 99) and now considering 78/177 (removed 99) transitions.
// Phase 1: matrix 78 rows 93 cols
[2023-03-19 03:06:35] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-19 03:06:35] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-19 03:06:35] [INFO ] Invariant cache hit.
[2023-03-19 03:06:35] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-19 03:06:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 03:06:35] [INFO ] Invariant cache hit.
[2023-03-19 03:06:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/192 places, 78/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 93/192 places, 78/177 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6728 steps with 135 reset in 23 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-12 finished in 568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0 U (X((!p1&&X((!p1 U (p2||G(!p1))))))||G(p0))))))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Applied a total of 10 rules in 8 ms. Remains 187 /192 variables (removed 5) and now considering 172/177 (removed 5) transitions.
// Phase 1: matrix 172 rows 187 cols
[2023-03-19 03:06:35] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:06:35] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-19 03:06:35] [INFO ] Invariant cache hit.
[2023-03-19 03:06:36] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-19 03:06:36] [INFO ] Invariant cache hit.
[2023-03-19 03:06:36] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/192 places, 172/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 187/192 places, 172/177 transitions.
Stuttering acceptance computed with spot in 72 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 s10 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 26 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-13 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 3 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:06:36] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:06:36] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 03:06:36] [INFO ] Invariant cache hit.
[2023-03-19 03:06:36] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-19 03:06:36] [INFO ] Invariant cache hit.
[2023-03-19 03:06:36] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 automaton TGBA Formula[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:(EQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5108 reset in 143 ms.
Product exploration explored 100000 steps with 5113 reset in 118 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 03:06:38] [INFO ] Invariant cache hit.
[2023-03-19 03:06:38] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2023-03-19 03:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:38] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-19 03:06:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:06:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-19 03:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:39] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-19 03:06:39] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-19 03:06:39] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2023-03-19 03:06:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-19 03:06:39] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-19 03:06:40] [INFO ] Added : 145 causal constraints over 31 iterations in 1177 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-19 03:06:40] [INFO ] Invariant cache hit.
[2023-03-19 03:06:40] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-19 03:06:40] [INFO ] Invariant cache hit.
[2023-03-19 03:06:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-19 03:06:40] [INFO ] Invariant cache hit.
[2023-03-19 03:06:40] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 03:06:41] [INFO ] Invariant cache hit.
[2023-03-19 03:06:42] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-19 03:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:42] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-19 03:06:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:06:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-19 03:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:06:42] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-19 03:06:42] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-19 03:06:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-19 03:06:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-19 03:06:42] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-19 03:06:43] [INFO ] Added : 145 causal constraints over 31 iterations in 1073 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5163 reset in 143 ms.
Product exploration explored 100000 steps with 5111 reset in 119 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 89 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 135 rules in 28 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2023-03-19 03:06:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2023-03-19 03:06:44] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-19 03:06:44] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 162/185 places, 148/170 transitions.
Built C files in :
/tmp/ltsmin9655581184253859033
[2023-03-19 03:06:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9655581184253859033
Running compilation step : cd /tmp/ltsmin9655581184253859033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin9655581184253859033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9655581184253859033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14954196600742322994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-19 03:06:59] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-19 03:06:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 03:06:59] [INFO ] Invariant cache hit.
[2023-03-19 03:07:00] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-19 03:07:00] [INFO ] Invariant cache hit.
[2023-03-19 03:07:00] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin6010097394375420964
[2023-03-19 03:07:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6010097394375420964
Running compilation step : cd /tmp/ltsmin6010097394375420964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin6010097394375420964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6010097394375420964;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9620524013921285123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 03:07:15] [INFO ] Flatten gal took : 8 ms
[2023-03-19 03:07:15] [INFO ] Flatten gal took : 7 ms
[2023-03-19 03:07:15] [INFO ] Time to serialize gal into /tmp/LTL14176451289888574306.gal : 2 ms
[2023-03-19 03:07:15] [INFO ] Time to serialize properties into /tmp/LTL13921602367374187814.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14176451289888574306.gal' '-t' 'CGAL' '-hoa' '/tmp/aut555511465415973542.hoa' '-atoms' '/tmp/LTL13921602367374187814.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13921602367374187814.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut555511465415973542.hoa
Detected timeout of ITS tools.
[2023-03-19 03:07:30] [INFO ] Flatten gal took : 19 ms
[2023-03-19 03:07:30] [INFO ] Flatten gal took : 13 ms
[2023-03-19 03:07:30] [INFO ] Time to serialize gal into /tmp/LTL2581175186348368867.gal : 3 ms
[2023-03-19 03:07:30] [INFO ] Time to serialize properties into /tmp/LTL4419526777178607329.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2581175186348368867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4419526777178607329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p144==1)")))))
Formula 0 simplified : XXG!"(p144==1)"
Detected timeout of ITS tools.
[2023-03-19 03:07:45] [INFO ] Flatten gal took : 15 ms
[2023-03-19 03:07:45] [INFO ] Applying decomposition
[2023-03-19 03:07:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14995052630788463057.txt' '-o' '/tmp/graph14995052630788463057.bin' '-w' '/tmp/graph14995052630788463057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14995052630788463057.bin' '-l' '-1' '-v' '-w' '/tmp/graph14995052630788463057.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:07:45] [INFO ] Decomposing Gal with order
[2023-03-19 03:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:07:45] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-19 03:07:45] [INFO ] Flatten gal took : 13 ms
[2023-03-19 03:07:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-19 03:07:45] [INFO ] Time to serialize gal into /tmp/LTL4568343401695942463.gal : 3 ms
[2023-03-19 03:07:45] [INFO ] Time to serialize properties into /tmp/LTL6095959074871511561.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4568343401695942463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6095959074871511561.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i8.i0.u52.p144==1)")))))
Formula 0 simplified : XXG!"(i8.i0.u52.p144==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16880034975571063243
[2023-03-19 03:08:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16880034975571063243
Running compilation step : cd /tmp/ltsmin16880034975571063243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin16880034975571063243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16880034975571063243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 99525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-003B-LTLFireability-15
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 191 transition count 153
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 168 transition count 153
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 168 transition count 138
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 76 place count 153 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 147 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 147 transition count 130
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 92 place count 145 transition count 130
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 188 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 190 place count 95 transition count 80
Applied a total of 190 rules in 30 ms. Remains 95 /192 variables (removed 97) and now considering 80/177 (removed 97) transitions.
// Phase 1: matrix 80 rows 95 cols
[2023-03-19 03:08:16] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-19 03:08:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 03:08:16] [INFO ] Invariant cache hit.
[2023-03-19 03:08:16] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 03:08:16] [INFO ] Invariant cache hit.
[2023-03-19 03:08:16] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 95/192 places, 80/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 450 ms. Remains : 95/192 places, 80/177 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 automaton TGBA Formula[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:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 204 steps with 0 reset in 1 ms.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 763 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 03:08:16] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9468998420128887713
[2023-03-19 03:08:16] [INFO ] Computing symmetric may disable matrix : 177 transitions.
[2023-03-19 03:08:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:16] [INFO ] Computing symmetric may enable matrix : 177 transitions.
[2023-03-19 03:08:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:16] [INFO ] Applying decomposition
[2023-03-19 03:08:16] [INFO ] Computing Do-Not-Accords matrix : 177 transitions.
[2023-03-19 03:08:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 03:08:16] [INFO ] Flatten gal took : 9 ms
[2023-03-19 03:08:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9468998420128887713
Running compilation step : cd /tmp/ltsmin9468998420128887713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9962345340814949536.txt' '-o' '/tmp/graph9962345340814949536.bin' '-w' '/tmp/graph9962345340814949536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9962345340814949536.bin' '-l' '-1' '-v' '-w' '/tmp/graph9962345340814949536.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:08:16] [INFO ] Decomposing Gal with order
[2023-03-19 03:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:08:16] [INFO ] Removed a total of 27 redundant transitions.
[2023-03-19 03:08:16] [INFO ] Flatten gal took : 13 ms
[2023-03-19 03:08:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-19 03:08:16] [INFO ] Time to serialize gal into /tmp/LTLFireability9535340459905798421.gal : 2 ms
[2023-03-19 03:08:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13837637107453008763.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9535340459905798421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13837637107453008763.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("((i6.i1.u41.p107==1)&&(i11.i0.u57.p158==1))")||(G("((i3.i1.u5.p16==1)&&(i3.i1.u18.p51==1))"))))))
Formula 0 simplified : G(F!"((i3.i1.u5.p16==1)&&(i3.i1.u18.p51==1))" & FG!"((i6.i1.u41.p107==1)&&(i11.i0.u57.p158==1))")
Compilation finished in 301 ms.
Running link step : cd /tmp/ltsmin9468998420128887713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9468998420128887713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t58, t61, t86, t89, t113, t116, t119, i0.i0.u6.t121, i0.i1.u15.t110, i0.i1.u16.t3, i0.i1.u16....1028
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 180, guards 177
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.180: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.180: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.180: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.191: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.228: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.249: There are 181 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.249: State length is 193, there are 183 groups
pins2lts-mc-linux64( 0/ 8), 0.249: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.249: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.249: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.249: Visible groups: 0 / 183, labels: 2 / 181
pins2lts-mc-linux64( 0/ 8), 0.249: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.249: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.269: [Blue] ~120 levels ~960 states ~1608 transitions
pins2lts-mc-linux64( 5/ 8), 0.293: [Blue] ~234 levels ~1920 states ~3584 transitions
pins2lts-mc-linux64( 5/ 8), 0.321: [Blue] ~433 levels ~3840 states ~6448 transitions
pins2lts-mc-linux64( 7/ 8), 0.369: [Blue] ~345 levels ~7680 states ~11512 transitions
pins2lts-mc-linux64( 7/ 8), 0.442: [Blue] ~358 levels ~15360 states ~21352 transitions
pins2lts-mc-linux64( 1/ 8), 0.608: [Blue] ~414 levels ~30720 states ~40304 transitions
pins2lts-mc-linux64( 1/ 8), 0.904: [Blue] ~414 levels ~61440 states ~81424 transitions
pins2lts-mc-linux64( 1/ 8), 1.420: [Blue] ~414 levels ~122880 states ~169136 transitions
pins2lts-mc-linux64( 7/ 8), 2.415: [Blue] ~391 levels ~245760 states ~335320 transitions
pins2lts-mc-linux64( 7/ 8), 3.966: [Blue] ~392 levels ~491520 states ~664168 transitions
pins2lts-mc-linux64( 1/ 8), 6.392: [Blue] ~421 levels ~983040 states ~1351616 transitions
pins2lts-mc-linux64( 7/ 8), 11.027: [Blue] ~392 levels ~1966080 states ~2745376 transitions
pins2lts-mc-linux64( 0/ 8), 19.952: [Blue] ~236 levels ~3932160 states ~5789880 transitions
pins2lts-mc-linux64( 7/ 8), 37.143: [Blue] ~393 levels ~7864320 states ~11143088 transitions
pins2lts-mc-linux64( 7/ 8), 72.612: [Blue] ~395 levels ~15728640 states ~23081864 transitions
pins2lts-mc-linux64( 0/ 8), 142.658: [Blue] ~236 levels ~31457280 states ~45990016 transitions
pins2lts-mc-linux64( 7/ 8), 286.775: [Blue] ~401 levels ~62914560 states ~95442344 transitions
pins2lts-mc-linux64( 7/ 8), 574.469: [Blue] ~405 levels ~125829120 states ~190186168 transitions
pins2lts-mc-linux64( 3/ 8), 643.722: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 643.779:
pins2lts-mc-linux64( 0/ 8), 643.779: Explored 134215199 states 201953724 transitions, fanout: 1.505
pins2lts-mc-linux64( 0/ 8), 643.779: Total exploration time 643.520 sec (643.460 sec minimum, 643.482 sec on average)
pins2lts-mc-linux64( 0/ 8), 643.779: States per second: 208564, Transitions per second: 313827
pins2lts-mc-linux64( 0/ 8), 643.779:
pins2lts-mc-linux64( 0/ 8), 643.779: State space has 134217288 states, 103720391 are accepting
pins2lts-mc-linux64( 0/ 8), 643.779: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 643.779: blue states: 134215199 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 643.779: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 643.779: all-red states: 134212510 (100.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 643.779:
pins2lts-mc-linux64( 0/ 8), 643.779: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 643.779:
pins2lts-mc-linux64( 0/ 8), 643.779: Queue width: 8B, total height: 3317, memory: 0.03MB
pins2lts-mc-linux64( 0/ 8), 643.779: Tree memory: 1049.2MB, 8.2 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 643.779: Tree fill ratio (roots/leafs): 99.0%/9.0%
pins2lts-mc-linux64( 0/ 8), 643.779: Stored 177 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 643.779: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 643.779: Est. total memory use: 1049.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9468998420128887713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9468998420128887713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 03:29:51] [INFO ] Applying decomposition
[2023-03-19 03:29:51] [INFO ] Flatten gal took : 21 ms
[2023-03-19 03:29:51] [INFO ] Decomposing Gal with order
[2023-03-19 03:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:29:51] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-19 03:29:51] [INFO ] Flatten gal took : 26 ms
[2023-03-19 03:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2023-03-19 03:29:51] [INFO ] Time to serialize gal into /tmp/LTLFireability1705115345690307479.gal : 3 ms
[2023-03-19 03:29:51] [INFO ] Time to serialize properties into /tmp/LTLFireability1247961031277248451.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1705115345690307479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1247961031277248451.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0.i1.u81.p158==1))")||(G("((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1...181
Formula 0 simplified : G(F!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1.i0.i0.u22.p51==1))" & FG!"((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0...174
Detected timeout of ITS tools.
[2023-03-19 03:51:28] [INFO ] Flatten gal took : 506 ms
[2023-03-19 03:51:29] [INFO ] Input system was already deterministic with 177 transitions.
[2023-03-19 03:51:29] [INFO ] Transformed 192 places.
[2023-03-19 03:51:29] [INFO ] Transformed 177 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-19 03:51:30] [INFO ] Time to serialize gal into /tmp/LTLFireability555270746051579002.gal : 15 ms
[2023-03-19 03:51:30] [INFO ] Time to serialize properties into /tmp/LTLFireability15402239895499806790.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability555270746051579002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15402239895499806790.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p107==1)&&(p158==1))")||(G("((p16==1)&&(p51==1))"))))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9550476 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16052612 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r389-oct2-167903713500396"
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 ;