Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789200423.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 337K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716989082356

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 13:24:44] [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]
[2024-05-29 13:24:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:24:44] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-29 13:24:44] [INFO ] Transformed 1253 places.
[2024-05-29 13:24:44] [INFO ] Transformed 903 transitions.
[2024-05-29 13:24:44] [INFO ] Found NUPN structural information;
[2024-05-29 13:24:44] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-050A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 139 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 13:24:45] [INFO ] Computed 551 invariants in 27 ms
[2024-05-29 13:24:46] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-29 13:24:46] [INFO ] Invariant cache hit.
[2024-05-29 13:24:47] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2024-05-29 13:24:47] [INFO ] Invariant cache hit.
[2024-05-29 13:24:48] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3704 ms. Remains : 1253/1253 places, 902/902 transitions.
Support contains 51 out of 1253 places after structural reductions.
[2024-05-29 13:24:48] [INFO ] Flatten gal took : 175 ms
[2024-05-29 13:24:48] [INFO ] Flatten gal took : 77 ms
[2024-05-29 13:24:49] [INFO ] Input system was already deterministic with 902 transitions.
Support contains 46 out of 1253 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-29 13:24:49] [INFO ] Invariant cache hit.
[2024-05-29 13:24:50] [INFO ] [Real]Absence check using 551 positive place invariants in 94 ms returned sat
[2024-05-29 13:24:53] [INFO ] After 3197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-29 13:24:53] [INFO ] [Nat]Absence check using 551 positive place invariants in 103 ms returned sat
[2024-05-29 13:24:57] [INFO ] After 3302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-29 13:25:00] [INFO ] After 5971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 2501 ms.
[2024-05-29 13:25:02] [INFO ] After 9624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Finished Parikh walk after 1849 steps, including 0 resets, run visited all 14 properties in 63 ms. (steps per millisecond=29 )
Parikh walk visited 19 properties in 578 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 13:25:03] [INFO ] Invariant cache hit.
[2024-05-29 13:25:04] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-29 13:25:04] [INFO ] Invariant cache hit.
[2024-05-29 13:25:06] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
[2024-05-29 13:25:06] [INFO ] Invariant cache hit.
[2024-05-29 13:25:06] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3086 ms. Remains : 1253/1253 places, 902/902 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s136 1) (EQ s146 1)), p0:(OR (EQ s1038 0) (EQ s1052 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3435 ms.
Product exploration explored 100000 steps with 50000 reset in 3404 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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-00 finished in 10275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 13:25:13] [INFO ] Invariant cache hit.
[2024-05-29 13:25:14] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-29 13:25:14] [INFO ] Invariant cache hit.
[2024-05-29 13:25:16] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2024-05-29 13:25:16] [INFO ] Invariant cache hit.
[2024-05-29 13:25:16] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3037 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s817 1) (EQ s819 1)), p0:(AND (EQ s1236 1) (EQ s1246 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 1 reset in 814 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-01 finished in 3979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((!(G(p0) U (p1 U p2))||!(p2 U p3)))))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 108 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 13:25:18] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 13:25:18] [INFO ] Implicit Places using invariants in 868 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 872 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 62 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 13:25:18] [INFO ] Computed 550 invariants in 5 ms
[2024-05-29 13:25:19] [INFO ] Implicit Places using invariants in 830 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 833 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 66 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 13:25:19] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:25:20] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-29 13:25:20] [INFO ] Invariant cache hit.
[2024-05-29 13:25:22] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4322 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND p2 p3), true, (AND p2 (NOT p3)), (AND (NOT p2) p3), (AND p0 p2), p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND p2 p3), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s317 1) (EQ s319 1)), p3:(AND (EQ s636 1) (EQ s646 1)), p1:(AND (EQ s906 1) (EQ s921 1)), p0:(AND (EQ s636 1) (EQ s646 1) (EQ s1055 1) (EQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 787 ms.
Product exploration explored 100000 steps with 0 reset in 1072 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 p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), true, (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 115 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 6 states, 12 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND p2 p3), true, (AND p2 (NOT p3)), (AND (NOT p2) p3), (AND p0 p2), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 124143 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1}
Probabilistic random walk after 124143 steps, saw 122974 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :5
Running SMT prover for 5 properties.
[2024-05-29 13:25:28] [INFO ] Invariant cache hit.
[2024-05-29 13:25:29] [INFO ] [Real]Absence check using 548 positive place invariants in 99 ms returned sat
[2024-05-29 13:25:29] [INFO ] After 978ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-29 13:25:30] [INFO ] [Nat]Absence check using 548 positive place invariants in 92 ms returned sat
[2024-05-29 13:25:31] [INFO ] After 1118ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-29 13:25:32] [INFO ] After 1785ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-05-29 13:25:32] [INFO ] After 2428ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1191 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=79 )
Parikh walk visited 3 properties in 154 ms.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Partial Free-agglomeration rule applied 195 times.
Drop transitions removed 195 transitions
Iterating global reduction 0 with 195 rules applied. Total rules applied 195 place count 1244 transition count 896
Applied a total of 195 rules in 153 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 1244/1244 places, 896/896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234401 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234401 steps, saw 227892 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 13:25:35] [INFO ] Computed 548 invariants in 11 ms
[2024-05-29 13:25:36] [INFO ] [Real]Absence check using 548 positive place invariants in 103 ms returned sat
[2024-05-29 13:25:36] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:25:36] [INFO ] [Nat]Absence check using 548 positive place invariants in 92 ms returned sat
[2024-05-29 13:25:37] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:25:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-29 13:25:38] [INFO ] After 502ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:25:38] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-29 13:25:38] [INFO ] After 1712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 802 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p0 p2))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), true, (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p3 p0)), (F (AND p2 (NOT p3))), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3) p1)), (F (NOT (OR (NOT p2) (NOT p3)))), (F (AND (NOT p2) p3 p1)), (F (AND p2 p3)), (F (AND p2 p0)), (F (AND (NOT p2) (NOT p3) p0)), (F p0)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p2) (NOT p3))))
Knowledge based reduction with 21 factoid took 271 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLFireability-03 finished in 20603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&X(!p0))||F((G(F(p0))||(!p1&&X(p0)))))))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1247 transition count 897
Applied a total of 9 rules in 107 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2024-05-29 13:25:38] [INFO ] Computed 550 invariants in 3 ms
[2024-05-29 13:25:39] [INFO ] Implicit Places using invariants in 658 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 661 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 64 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2024-05-29 13:25:39] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 13:25:40] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-29 13:25:40] [INFO ] Invariant cache hit.
[2024-05-29 13:25:41] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2941 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 69 ms :[false, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s896 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 33336 reset in 1067 ms.
Product exploration explored 100000 steps with 33348 reset in 1162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[false, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4434 steps, run visited all 1 properties in 63 ms. (steps per millisecond=70 )
Probabilistic random walk after 4434 steps, saw 4267 distinct states, run finished after 64 ms. (steps per millisecond=69 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[false, (NOT p0)]
Support contains 1 out of 1243 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 30 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 13:25:44] [INFO ] Invariant cache hit.
[2024-05-29 13:25:45] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-29 13:25:45] [INFO ] Invariant cache hit.
[2024-05-29 13:25:46] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
[2024-05-29 13:25:46] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-29 13:25:46] [INFO ] Invariant cache hit.
[2024-05-29 13:25:47] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2951 ms. Remains : 1243/1243 places, 895/895 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[false, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4434 steps, run visited all 1 properties in 50 ms. (steps per millisecond=88 )
Probabilistic random walk after 4434 steps, saw 4267 distinct states, run finished after 51 ms. (steps per millisecond=86 ) properties seen :1
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[false, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[false, (NOT p0)]
Product exploration explored 100000 steps with 33342 reset in 1051 ms.
Product exploration explored 100000 steps with 33474 reset in 1211 ms.
Built C files in :
/tmp/ltsmin7021214155439247129
[2024-05-29 13:25:50] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 13:25:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:25:50] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 13:25:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:25:50] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 13:25:50] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:25:50] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7021214155439247129
Running compilation step : cd /tmp/ltsmin7021214155439247129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2577 ms.
Running link step : cd /tmp/ltsmin7021214155439247129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7021214155439247129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5833372361028704323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 25 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 13:26:05] [INFO ] Invariant cache hit.
[2024-05-29 13:26:06] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-29 13:26:06] [INFO ] Invariant cache hit.
[2024-05-29 13:26:07] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2024-05-29 13:26:07] [INFO ] Redundant transitions in 81 ms returned []
[2024-05-29 13:26:07] [INFO ] Invariant cache hit.
[2024-05-29 13:26:08] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2849 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin2217767426613712234
[2024-05-29 13:26:08] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 13:26:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:08] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 13:26:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:08] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 13:26:08] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:08] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2217767426613712234
Running compilation step : cd /tmp/ltsmin2217767426613712234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2419 ms.
Running link step : cd /tmp/ltsmin2217767426613712234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2217767426613712234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1643046468980249910.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:26:23] [INFO ] Flatten gal took : 42 ms
[2024-05-29 13:26:23] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:26:23] [INFO ] Time to serialize gal into /tmp/LTL9988523743279339811.gal : 9 ms
[2024-05-29 13:26:23] [INFO ] Time to serialize properties into /tmp/LTL13820245162240010194.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9988523743279339811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10148481786760111753.hoa' '-atoms' '/tmp/LTL13820245162240010194.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13820245162240010194.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10148481786760111753.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1179 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.9197,374660,1,0,121,2.41843e+06,25,48,28994,1.19164e+06,265
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-050A-LTLFireability-04 finished in 58661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p1) U ((X(p1)&&G(p2))||X(G(p1))))))))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1247 transition count 897
Applied a total of 9 rules in 97 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2024-05-29 13:26:37] [INFO ] Computed 550 invariants in 2 ms
[2024-05-29 13:26:38] [INFO ] Implicit Places using invariants in 834 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 836 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 72 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2024-05-29 13:26:38] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:26:39] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-29 13:26:39] [INFO ] Invariant cache hit.
[2024-05-29 13:26:40] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3314 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s994 1), p0:(EQ s994 0), p1:(NEQ s223 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33324 reset in 1067 ms.
Product exploration explored 100000 steps with 33315 reset in 1165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 152 ms. Reduced automaton from 4 states, 29 edges and 3 AP (stutter insensitive) to 6 states, 36 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 13:26:44] [INFO ] Invariant cache hit.
[2024-05-29 13:26:44] [INFO ] [Real]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-05-29 13:26:45] [INFO ] After 932ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2024-05-29 13:26:45] [INFO ] [Nat]Absence check using 548 positive place invariants in 100 ms returned sat
[2024-05-29 13:26:46] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2024-05-29 13:26:46] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-29 13:26:46] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 39 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1243/1243 places, 895/895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Finished probabilistic random walk after 48504 steps, run visited all 3 properties in 878 ms. (steps per millisecond=55 )
Probabilistic random walk after 48504 steps, saw 47765 distinct states, run finished after 880 ms. (steps per millisecond=55 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 21 factoid took 801 ms. Reduced automaton from 6 states, 36 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p2))]
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 31 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 13:26:48] [INFO ] Invariant cache hit.
[2024-05-29 13:26:49] [INFO ] Implicit Places using invariants in 802 ms returned []
[2024-05-29 13:26:49] [INFO ] Invariant cache hit.
[2024-05-29 13:26:51] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2024-05-29 13:26:51] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 13:26:51] [INFO ] Invariant cache hit.
[2024-05-29 13:26:51] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3092 ms. Remains : 1243/1243 places, 895/895 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:26:52] [INFO ] Invariant cache hit.
[2024-05-29 13:26:52] [INFO ] [Real]Absence check using 548 positive place invariants in 91 ms returned sat
[2024-05-29 13:26:53] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:26:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 104 ms returned sat
[2024-05-29 13:26:54] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:26:54] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 13:26:54] [INFO ] After 1178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 42 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1243/1243 places, 895/895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Finished probabilistic random walk after 48504 steps, run visited all 2 properties in 1050 ms. (steps per millisecond=46 )
Probabilistic random walk after 48504 steps, saw 47765 distinct states, run finished after 1052 ms. (steps per millisecond=46 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 822 ms.
Product exploration explored 100000 steps with 0 reset in 1045 ms.
Built C files in :
/tmp/ltsmin16465406576732055746
[2024-05-29 13:26:58] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 13:26:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:58] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 13:26:58] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:58] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 13:26:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:26:58] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16465406576732055746
Running compilation step : cd /tmp/ltsmin16465406576732055746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2517 ms.
Running link step : cd /tmp/ltsmin16465406576732055746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16465406576732055746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13014794690116172164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 895/895 transitions.
Applied a total of 0 rules in 27 ms. Remains 1243 /1243 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2024-05-29 13:27:13] [INFO ] Invariant cache hit.
[2024-05-29 13:27:14] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-29 13:27:14] [INFO ] Invariant cache hit.
[2024-05-29 13:27:15] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2024-05-29 13:27:15] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-29 13:27:15] [INFO ] Invariant cache hit.
[2024-05-29 13:27:16] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2974 ms. Remains : 1243/1243 places, 895/895 transitions.
Built C files in :
/tmp/ltsmin944805821036468292
[2024-05-29 13:27:16] [INFO ] Computing symmetric may disable matrix : 895 transitions.
[2024-05-29 13:27:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:27:16] [INFO ] Computing symmetric may enable matrix : 895 transitions.
[2024-05-29 13:27:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:27:16] [INFO ] Computing Do-Not-Accords matrix : 895 transitions.
[2024-05-29 13:27:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:27:16] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin944805821036468292
Running compilation step : cd /tmp/ltsmin944805821036468292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2489 ms.
Running link step : cd /tmp/ltsmin944805821036468292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin944805821036468292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15496492485556235738.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:27:31] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:27:31] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:27:31] [INFO ] Time to serialize gal into /tmp/LTL13685493779111098832.gal : 7 ms
[2024-05-29 13:27:31] [INFO ] Time to serialize properties into /tmp/LTL17858317156370475098.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13685493779111098832.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3364632516292488945.hoa' '-atoms' '/tmp/LTL17858317156370475098.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17858317156370475098.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3364632516292488945.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:27:46] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:27:46] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:27:46] [INFO ] Time to serialize gal into /tmp/LTL17676961971227995747.gal : 5 ms
[2024-05-29 13:27:46] [INFO ] Time to serialize properties into /tmp/LTL8522071836529494820.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17676961971227995747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8522071836529494820.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p995==0)"))||((X("(p224==0)"))U((X(G("(p224==0)")))||((X("(p224==0)"))&&(G("(p995==0)")))))))))
Formula 0 simplified : G(F!"(p995==0)" & F!"(p224==0)" & FG(F!"(p995==0)" | X!"(p224==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:28:01] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:28:01] [INFO ] Applying decomposition
[2024-05-29 13:28:01] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3393149261583451453.txt' '-o' '/tmp/graph3393149261583451453.bin' '-w' '/tmp/graph3393149261583451453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3393149261583451453.bin' '-l' '-1' '-v' '-w' '/tmp/graph3393149261583451453.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:28:01] [INFO ] Decomposing Gal with order
[2024-05-29 13:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:28:02] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 13:28:02] [INFO ] Flatten gal took : 90 ms
[2024-05-29 13:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 24 ms.
[2024-05-29 13:28:02] [INFO ] Time to serialize gal into /tmp/LTL8570523133532519834.gal : 18 ms
[2024-05-29 13:28:02] [INFO ] Time to serialize properties into /tmp/LTL2048441367744537499.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8570523133532519834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2048441367744537499.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i19.i0.i1.u317.p995==0)"))||((X("(i4.i0.i0.u71.p224==0)"))U((X(G("(i4.i0.i0.u71.p224==0)")))||((X("(i4.i0.i0.u71.p224==0)"...197
Formula 0 simplified : G(F!"(i19.i0.i1.u317.p995==0)" & F!"(i4.i0.i0.u71.p224==0)" & FG(F!"(i19.i0.i1.u317.p995==0)" | X!"(i4.i0.i0.u71.p224==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin418832442874496521
[2024-05-29 13:28:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin418832442874496521
Running compilation step : cd /tmp/ltsmin418832442874496521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin418832442874496521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin418832442874496521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||(X((LTLAPp1==true))&&[]((LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-05 finished in 115131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 50 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 13:28:32] [INFO ] Computed 551 invariants in 7 ms
[2024-05-29 13:28:33] [INFO ] Implicit Places using invariants in 824 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 826 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 31 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 13:28:33] [INFO ] Computed 550 invariants in 8 ms
[2024-05-29 13:28:34] [INFO ] Implicit Places using invariants in 882 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 885 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 60 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 13:28:34] [INFO ] Computed 548 invariants in 9 ms
[2024-05-29 13:28:35] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-29 13:28:35] [INFO ] Invariant cache hit.
[2024-05-29 13:28:36] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4308 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-06 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:(AND (OR (NEQ s1105 1) (NEQ s1122 1)) (OR (NEQ s82 1) (NEQ s84 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 143 reset in 758 ms.
Product exploration explored 100000 steps with 146 reset in 923 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 226 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 29 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 13:28:38] [INFO ] Invariant cache hit.
[2024-05-29 13:28:39] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-29 13:28:39] [INFO ] Invariant cache hit.
[2024-05-29 13:28:41] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2024-05-29 13:28:41] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 13:28:41] [INFO ] Invariant cache hit.
[2024-05-29 13:28:42] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3283 ms. Remains : 1244/1244 places, 896/896 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 376 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 153 reset in 763 ms.
Product exploration explored 100000 steps with 143 reset in 920 ms.
Built C files in :
/tmp/ltsmin11178856701134933827
[2024-05-29 13:28:44] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 13:28:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:28:44] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 13:28:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:28:44] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 13:28:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:28:44] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11178856701134933827
Running compilation step : cd /tmp/ltsmin11178856701134933827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2445 ms.
Running link step : cd /tmp/ltsmin11178856701134933827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11178856701134933827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased199556417155398127.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 13:28:59] [INFO ] Invariant cache hit.
[2024-05-29 13:29:00] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-29 13:29:00] [INFO ] Invariant cache hit.
[2024-05-29 13:29:01] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2024-05-29 13:29:01] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 13:29:01] [INFO ] Invariant cache hit.
[2024-05-29 13:29:02] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3130 ms. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin8629062406728934455
[2024-05-29 13:29:02] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 13:29:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:29:02] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 13:29:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:29:02] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 13:29:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:29:02] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8629062406728934455
Running compilation step : cd /tmp/ltsmin8629062406728934455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2521 ms.
Running link step : cd /tmp/ltsmin8629062406728934455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8629062406728934455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1759957671507033427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:29:17] [INFO ] Flatten gal took : 39 ms
[2024-05-29 13:29:17] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:29:17] [INFO ] Time to serialize gal into /tmp/LTL16602509148600096629.gal : 6 ms
[2024-05-29 13:29:17] [INFO ] Time to serialize properties into /tmp/LTL18046667398946836062.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16602509148600096629.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17371431190209198781.hoa' '-atoms' '/tmp/LTL18046667398946836062.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18046667398946836062.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17371431190209198781.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:29:32] [INFO ] Flatten gal took : 37 ms
[2024-05-29 13:29:32] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:29:32] [INFO ] Time to serialize gal into /tmp/LTL11010038375989981934.gal : 6 ms
[2024-05-29 13:29:32] [INFO ] Time to serialize properties into /tmp/LTL15141042156292603693.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11010038375989981934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15141042156292603693.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p1105==0)||(p1122==0))&&((p82==0)||(p84==0)))"))))
Formula 0 simplified : FG!"(((p1105==0)||(p1122==0))&&((p82==0)||(p84==0)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:29:47] [INFO ] Flatten gal took : 38 ms
[2024-05-29 13:29:47] [INFO ] Applying decomposition
[2024-05-29 13:29:48] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9218215997550034279.txt' '-o' '/tmp/graph9218215997550034279.bin' '-w' '/tmp/graph9218215997550034279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9218215997550034279.bin' '-l' '-1' '-v' '-w' '/tmp/graph9218215997550034279.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:29:48] [INFO ] Decomposing Gal with order
[2024-05-29 13:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:29:48] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 13:29:48] [INFO ] Flatten gal took : 60 ms
[2024-05-29 13:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 77 ms.
[2024-05-29 13:29:48] [INFO ] Time to serialize gal into /tmp/LTL7823302187801862768.gal : 12 ms
[2024-05-29 13:29:48] [INFO ] Time to serialize properties into /tmp/LTL581121439532366789.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7823302187801862768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL581121439532366789.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i22.u354.p1105==0)||(i22.u358.p1122==0))&&((i2.u26.p82==0)||(i2.u26.p84==0)))"))))
Formula 0 simplified : FG!"(((i22.u354.p1105==0)||(i22.u358.p1122==0))&&((i2.u26.p82==0)||(i2.u26.p84==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7865561810542290607
[2024-05-29 13:30:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7865561810542290607
Running compilation step : cd /tmp/ltsmin7865561810542290607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1598 ms.
Running link step : cd /tmp/ltsmin7865561810542290607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7865561810542290607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 8080 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-050A-LTLFireability-06 finished in 100830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 13:30:13] [INFO ] Computed 551 invariants in 3 ms
[2024-05-29 13:30:14] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-05-29 13:30:14] [INFO ] Invariant cache hit.
[2024-05-29 13:30:15] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2431 ms to find 0 implicit places.
[2024-05-29 13:30:15] [INFO ] Invariant cache hit.
[2024-05-29 13:30:16] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3165 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s178 1) (EQ s201 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 761 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-07 finished in 4013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p2)||p1)&&p0))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 52 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 13:30:17] [INFO ] Computed 551 invariants in 7 ms
[2024-05-29 13:30:18] [INFO ] Implicit Places using invariants in 833 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 835 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 31 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 13:30:18] [INFO ] Computed 550 invariants in 5 ms
[2024-05-29 13:30:18] [INFO ] Implicit Places using invariants in 789 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 790 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 46 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 13:30:18] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:30:19] [INFO ] Implicit Places using invariants in 810 ms returned []
[2024-05-29 13:30:19] [INFO ] Invariant cache hit.
[2024-05-29 13:30:21] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4060 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 2170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1187 1) (EQ s1189 1)), p1:(OR (EQ s1165 0) (EQ s1199 0)), p2:(OR (EQ s131 0) (EQ s146 0))], 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 0 reset in 763 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-08 finished in 7018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((G(p0) U p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2024-05-29 13:30:24] [INFO ] Computed 551 invariants in 4 ms
[2024-05-29 13:30:25] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-29 13:30:25] [INFO ] Invariant cache hit.
[2024-05-29 13:30:26] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2024-05-29 13:30:26] [INFO ] Invariant cache hit.
[2024-05-29 13:30:27] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3087 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s1091 1) (EQ s1102 1)), p1:(AND (EQ s28 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 177 reset in 794 ms.
Stack based approach found an accepted trace after 221 steps with 0 reset with depth 222 and stack size 222 in 3 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-13 finished in 3970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(X(F(p1)))))&&X(p2)))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-05-29 13:30:28] [INFO ] Invariant cache hit.
[2024-05-29 13:30:28] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-05-29 13:30:28] [INFO ] Invariant cache hit.
[2024-05-29 13:30:30] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2024-05-29 13:30:30] [INFO ] Invariant cache hit.
[2024-05-29 13:30:31] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2960 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (EQ s47 1) (EQ s954 0) (EQ s973 0)), p0:(AND (EQ s954 1) (EQ s973 1)), p1:(EQ s47 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 767 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLFireability-14 finished in 3908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&F(p1))||G(!p0)))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Applied a total of 4 rules in 51 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
// Phase 1: matrix 900 rows 1251 cols
[2024-05-29 13:30:32] [INFO ] Computed 551 invariants in 6 ms
[2024-05-29 13:30:32] [INFO ] Implicit Places using invariants in 815 ms returned [1244]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 829 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 900/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 898
Applied a total of 4 rules in 30 ms. Remains 1248 /1250 variables (removed 2) and now considering 898/900 (removed 2) transitions.
// Phase 1: matrix 898 rows 1248 cols
[2024-05-29 13:30:33] [INFO ] Computed 550 invariants in 13 ms
[2024-05-29 13:30:33] [INFO ] Implicit Places using invariants in 826 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 830 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/1253 places, 898/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 896
Applied a total of 4 rules in 45 ms. Remains 1244 /1246 variables (removed 2) and now considering 896/898 (removed 2) transitions.
// Phase 1: matrix 896 rows 1244 cols
[2024-05-29 13:30:33] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:30:34] [INFO ] Implicit Places using invariants in 802 ms returned []
[2024-05-29 13:30:34] [INFO ] Invariant cache hit.
[2024-05-29 13:30:36] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1244/1253 places, 896/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4033 ms. Remains : 1244/1253 places, 896/902 transitions.
Stuttering acceptance computed with spot in 3568 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s729 1) (EQ s748 1)), p0:(AND (EQ s628 1) (EQ s651 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 777 ms.
Product exploration explored 100000 steps with 1 reset in 968 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 (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Finished probabilistic random walk after 23020 steps, run visited all 3 properties in 433 ms. (steps per millisecond=53 )
Probabilistic random walk after 23020 steps, saw 22480 distinct states, run finished after 436 ms. (steps per millisecond=52 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 107 ms :[p0, (AND p0 (NOT p1)), p0]
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 27 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 13:30:43] [INFO ] Invariant cache hit.
[2024-05-29 13:30:44] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-29 13:30:44] [INFO ] Invariant cache hit.
[2024-05-29 13:30:45] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2440 ms to find 0 implicit places.
[2024-05-29 13:30:45] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 13:30:45] [INFO ] Invariant cache hit.
[2024-05-29 13:30:46] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3212 ms. Remains : 1244/1244 places, 896/896 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 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Finished probabilistic random walk after 23020 steps, run visited all 3 properties in 415 ms. (steps per millisecond=55 )
Probabilistic random walk after 23020 steps, saw 22480 distinct states, run finished after 416 ms. (steps per millisecond=55 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 2613 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 121 ms :[p0, (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 0 reset in 763 ms.
Product exploration explored 100000 steps with 0 reset in 978 ms.
Built C files in :
/tmp/ltsmin16144208593605684294
[2024-05-29 13:30:54] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 13:30:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:30:54] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 13:30:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:30:54] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 13:30:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:30:54] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16144208593605684294
Running compilation step : cd /tmp/ltsmin16144208593605684294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2596 ms.
Running link step : cd /tmp/ltsmin16144208593605684294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16144208593605684294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14899697542850372079.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 896/896 transitions.
Applied a total of 0 rules in 24 ms. Remains 1244 /1244 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-05-29 13:31:09] [INFO ] Invariant cache hit.
[2024-05-29 13:31:10] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-29 13:31:10] [INFO ] Invariant cache hit.
[2024-05-29 13:31:12] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
[2024-05-29 13:31:12] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 13:31:12] [INFO ] Invariant cache hit.
[2024-05-29 13:31:12] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2931 ms. Remains : 1244/1244 places, 896/896 transitions.
Built C files in :
/tmp/ltsmin2470699056006873742
[2024-05-29 13:31:12] [INFO ] Computing symmetric may disable matrix : 896 transitions.
[2024-05-29 13:31:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:31:12] [INFO ] Computing symmetric may enable matrix : 896 transitions.
[2024-05-29 13:31:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:31:12] [INFO ] Computing Do-Not-Accords matrix : 896 transitions.
[2024-05-29 13:31:12] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:31:12] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2470699056006873742
Running compilation step : cd /tmp/ltsmin2470699056006873742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2779 ms.
Running link step : cd /tmp/ltsmin2470699056006873742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin2470699056006873742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16977129750373286442.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:31:27] [INFO ] Flatten gal took : 40 ms
[2024-05-29 13:31:27] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:31:27] [INFO ] Time to serialize gal into /tmp/LTL1632464915570175583.gal : 5 ms
[2024-05-29 13:31:27] [INFO ] Time to serialize properties into /tmp/LTL16565687390151254174.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1632464915570175583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1923271300447972720.hoa' '-atoms' '/tmp/LTL16565687390151254174.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16565687390151254174.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1923271300447972720.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:31:43] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:31:43] [INFO ] Flatten gal took : 37 ms
[2024-05-29 13:31:43] [INFO ] Time to serialize gal into /tmp/LTL4298183707790525991.gal : 5 ms
[2024-05-29 13:31:43] [INFO ] Time to serialize properties into /tmp/LTL18377711837054370577.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4298183707790525991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18377711837054370577.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p628==0)||(p651==0))"))||((X("((p628==0)||(p651==0))"))&&(F("((p729==1)&&(p748==1))")))))))
Formula 0 simplified : G(F!"((p628==0)||(p651==0))" & F(G!"((p729==1)&&(p748==1))" | G!"((p628==0)||(p651==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:31:58] [INFO ] Flatten gal took : 39 ms
[2024-05-29 13:31:58] [INFO ] Applying decomposition
[2024-05-29 13:31:58] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13970627426584623147.txt' '-o' '/tmp/graph13970627426584623147.bin' '-w' '/tmp/graph13970627426584623147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13970627426584623147.bin' '-l' '-1' '-v' '-w' '/tmp/graph13970627426584623147.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:31:58] [INFO ] Decomposing Gal with order
[2024-05-29 13:31:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:31:58] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 13:31:58] [INFO ] Flatten gal took : 46 ms
[2024-05-29 13:31:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 80 ms.
[2024-05-29 13:31:58] [INFO ] Time to serialize gal into /tmp/LTL5481885219211913825.gal : 10 ms
[2024-05-29 13:31:58] [INFO ] Time to serialize properties into /tmp/LTL12806833009123893731.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5481885219211913825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12806833009123893731.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i10.u201.p628==0)||(i10.u208.p651==0))"))||((X("((i10.u201.p628==0)||(i10.u208.p651==0))"))&&(F("((i12.u233.p729==1)&&(i1...179
Formula 0 simplified : G(F!"((i10.u201.p628==0)||(i10.u208.p651==0))" & F(G!"((i12.u233.p729==1)&&(i12.u238.p748==1))" | G!"((i10.u201.p628==0)||(i10.u208....167
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14370967305639966300
[2024-05-29 13:32:13] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14370967305639966300
Running compilation step : cd /tmp/ltsmin14370967305639966300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1601 ms.
Running link step : cd /tmp/ltsmin14370967305639966300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14370967305639966300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050A-LTLFireability-15 finished in 116521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p1) U ((X(p1)&&G(p2))||X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&F(p1))||G(!p0)))))'
[2024-05-29 13:32:28] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4260614051557397737
[2024-05-29 13:32:28] [INFO ] Applying decomposition
[2024-05-29 13:32:28] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2024-05-29 13:32:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:32:28] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2024-05-29 13:32:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:32:29] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6996579594907447828.txt' '-o' '/tmp/graph6996579594907447828.bin' '-w' '/tmp/graph6996579594907447828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6996579594907447828.bin' '-l' '-1' '-v' '-w' '/tmp/graph6996579594907447828.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:32:29] [INFO ] Decomposing Gal with order
[2024-05-29 13:32:29] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
[2024-05-29 13:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:32:29] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:32:29] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4260614051557397737
Running compilation step : cd /tmp/ltsmin4260614051557397737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 13:32:29] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-29 13:32:29] [INFO ] Flatten gal took : 44 ms
[2024-05-29 13:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 43 ms.
[2024-05-29 13:32:29] [INFO ] Time to serialize gal into /tmp/LTLFireability1535811583629475060.gal : 9 ms
[2024-05-29 13:32:29] [INFO ] Time to serialize properties into /tmp/LTLFireability18284622060832739419.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1535811583629475060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18284622060832739419.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F((G("(i17.u317.p995==0)"))||((X("(i3.u71.p224!=1)"))U(((X("(i3.u71.p224!=1)"))&&(G("(i17.u317.p995!=1)")))||(X(G("(i3.u71.p224!=...167
Formula 0 simplified : G(F!"(i17.u317.p995==0)" & F!"(i3.u71.p224!=1)" & FG(X!"(i3.u71.p224!=1)" | F!"(i17.u317.p995!=1)"))
Compilation finished in 2680 ms.
Running link step : cd /tmp/ltsmin4260614051557397737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4260614051557397737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
4194 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.0522,715896,1,0,1.42431e+06,536,5909,3.34626e+06,132,2756,1737693
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(((X(!("((i11.u201.p628==1)&&(i11.u208.p651==1))")))&&(F("((i12.u233.p729==1)&&(i12.u238.p748==1))")))||(G(!("((i11.u201.p628==1...185
Formula 1 simplified : G(F"((i11.u201.p628==1)&&(i11.u208.p651==1))" & F(G!"((i12.u233.p729==1)&&(i12.u238.p748==1))" | G"((i11.u201.p628==1)&&(i11.u208.p6...165
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.097: LTL layer: formula: [](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.097: "[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.098: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.131: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.402: There are 908 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.402: State length is 1254, there are 956 groups
pins2lts-mc-linux64( 0/ 8), 0.402: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.402: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.402: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.402: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.496: [Blue] ~62 levels ~960 states ~3728 transitions
pins2lts-mc-linux64( 5/ 8), 0.589: [Blue] ~146 levels ~1920 states ~10336 transitions
pins2lts-mc-linux64( 5/ 8), 0.723: [Blue] ~296 levels ~3840 states ~20960 transitions
pins2lts-mc-linux64( 5/ 8), 1.055: [Blue] ~557 levels ~7680 states ~44272 transitions
pins2lts-mc-linux64( 4/ 8), 1.560: [Blue] ~1010 levels ~15360 states ~88656 transitions
pins2lts-mc-linux64( 5/ 8), 2.454: [Blue] ~2157 levels ~30720 states ~189408 transitions
pins2lts-mc-linux64( 5/ 8), 4.141: [Blue] ~4307 levels ~61440 states ~399184 transitions
pins2lts-mc-linux64( 1/ 8), 7.171: [Blue] ~8739 levels ~122880 states ~841136 transitions
pins2lts-mc-linux64( 5/ 8), 12.880: [Blue] ~17338 levels ~245760 states ~1733488 transitions
pins2lts-mc-linux64( 1/ 8), 23.514: [Blue] ~34162 levels ~491520 states ~3637888 transitions
pins2lts-mc-linux64( 1/ 8), 44.878: [Blue] ~87439 levels ~983040 states ~7042704 transitions
pins2lts-mc-linux64( 1/ 8), 88.007: [Blue] ~209042 levels ~1966080 states ~14183944 transitions
pins2lts-mc-linux64( 1/ 8), 108.096: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 108.478:
pins2lts-mc-linux64( 0/ 8), 108.478: Explored 2255341 states 18457245 transitions, fanout: 8.184
pins2lts-mc-linux64( 0/ 8), 108.478: Total exploration time 108.050 sec (107.690 sec minimum, 107.856 sec on average)
pins2lts-mc-linux64( 0/ 8), 108.478: States per second: 20873, Transitions per second: 170821
pins2lts-mc-linux64( 0/ 8), 108.478:
pins2lts-mc-linux64( 0/ 8), 108.478: State space has 10649008 states, 558672 are accepting
pins2lts-mc-linux64( 0/ 8), 108.478: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 108.478: blue states: 2255341 (21.18%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 108.478: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 108.478: all-red states: 558815 (5.25%), bogus 7 (0.00%)
pins2lts-mc-linux64( 0/ 8), 108.478:
pins2lts-mc-linux64( 0/ 8), 108.478: Total memory used for local state coloring: 25.7MB
pins2lts-mc-linux64( 0/ 8), 108.478:
pins2lts-mc-linux64( 0/ 8), 108.478: Queue width: 8B, total height: 1684164, memory: 12.85MB
pins2lts-mc-linux64( 0/ 8), 108.478: Tree memory: 337.2MB, 33.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 108.478: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 108.478: Stored 911 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 108.478: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 108.478: Est. total memory use: 350.1MB (~1036.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4260614051557397737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4260614051557397737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[]((LTLAPp2==true)))||X([]((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)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1094 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,52.9983,1192896,1,0,2.51467e+06,536,5979,6.56262e+06,133,2756,2174169
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 585391 ms.

BK_STOP 1716989680780

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldPPPt-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-050A, 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 r373-tall-171683789200423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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