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-171683789200413.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-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.9K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:06 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 268K 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-040A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716987752576

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-040A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 13:02:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:02:34] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-29 13:02:34] [INFO ] Transformed 1003 places.
[2024-05-29 13:02:34] [INFO ] Transformed 723 transitions.
[2024-05-29 13:02:34] [INFO ] Found NUPN structural information;
[2024-05-29 13:02:34] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 232 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 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 103 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:02:34] [INFO ] Computed 441 invariants in 28 ms
[2024-05-29 13:02:35] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-05-29 13:02:35] [INFO ] Invariant cache hit.
[2024-05-29 13:02:36] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-05-29 13:02:36] [INFO ] Invariant cache hit.
[2024-05-29 13:02:37] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2634 ms. Remains : 1003/1003 places, 722/722 transitions.
Support contains 41 out of 1003 places after structural reductions.
[2024-05-29 13:02:39] [INFO ] Flatten gal took : 178 ms
[2024-05-29 13:02:39] [INFO ] Flatten gal took : 66 ms
[2024-05-29 13:02:39] [INFO ] Input system was already deterministic with 722 transitions.
Support contains 38 out of 1003 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-29 13:02:41] [INFO ] Invariant cache hit.
[2024-05-29 13:02:42] [INFO ] [Real]Absence check using 441 positive place invariants in 103 ms returned sat
[2024-05-29 13:02:43] [INFO ] After 2263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-29 13:02:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 63 ms returned sat
[2024-05-29 13:02:45] [INFO ] After 1567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2024-05-29 13:02:46] [INFO ] After 2715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 862 ms.
[2024-05-29 13:02:47] [INFO ] After 4310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Finished Parikh walk after 1125 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=43 )
Parikh walk visited 13 properties in 243 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-13 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(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 36 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:02:53] [INFO ] Invariant cache hit.
[2024-05-29 13:02:54] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 13:02:54] [INFO ] Invariant cache hit.
[2024-05-29 13:02:55] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1847 ms to find 0 implicit places.
[2024-05-29 13:02:55] [INFO ] Invariant cache hit.
[2024-05-29 13:02:56] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2439 ms. Remains : 1003/1003 places, 722/722 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 237 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s904 1) (EQ s923 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-01 finished in 2742 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))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 73 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:02:56] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 13:02:57] [INFO ] Implicit Places using invariants in 660 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 665 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 47 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:02:57] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:02:57] [INFO ] Implicit Places using invariants in 662 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 664 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 50 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:02:57] [INFO ] Computed 438 invariants in 11 ms
[2024-05-29 13:02:58] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 13:02:58] [INFO ] Invariant cache hit.
[2024-05-29 13:02:59] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3286 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 2171 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s915 1) (EQ s949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2417 reset in 877 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-02 finished in 6363 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((p0||X(p1)))))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:03:02] [INFO ] Computed 441 invariants in 8 ms
[2024-05-29 13:03:03] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-29 13:03:03] [INFO ] Invariant cache hit.
[2024-05-29 13:03:04] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
[2024-05-29 13:03:04] [INFO ] Invariant cache hit.
[2024-05-29 13:03:05] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2361 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s880 1) (EQ s897 1)), p1:(OR (EQ s880 0) (EQ s897 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 800 ms.
Stack based approach found an accepted trace after 406 steps with 0 reset with depth 407 and stack size 347 in 4 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-03 finished in 3606 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)) U (p1||G((p2 U p3)))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 61 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:03:06] [INFO ] Computed 441 invariants in 8 ms
[2024-05-29 13:03:07] [INFO ] Implicit Places using invariants in 608 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 611 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 33 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:03:07] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:03:07] [INFO ] Implicit Places using invariants in 643 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 645 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 44 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:03:07] [INFO ] Computed 438 invariants in 7 ms
[2024-05-29 13:03:08] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 13:03:08] [INFO ] Invariant cache hit.
[2024-05-29 13:03:09] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3231 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s282 1) (EQ s284 1)), p3:(NEQ s749 1), p2:(NEQ s297 1), p0:(AND (EQ s556 1) (EQ s571 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 16 reset in 673 ms.
Product exploration explored 100000 steps with 20 reset in 869 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) p3 p2 (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 126 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 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 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 13:03:12] [INFO ] Invariant cache hit.
[2024-05-29 13:03:12] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2024-05-29 13:03:13] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:03:13] [INFO ] [Nat]Absence check using 438 positive place invariants in 74 ms returned sat
[2024-05-29 13:03:14] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 13:03:15] [INFO ] After 1246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 439 ms.
[2024-05-29 13:03:15] [INFO ] After 2111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 1037 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=79 )
Parikh walk visited 7 properties in 228 ms.
Knowledge obtained : [(AND (NOT p1) p3 p2 (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) (NOT p2))), (F p0), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p3) p2)), (F (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (F (AND (NOT p3) p2 (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (F (AND p0 (NOT p3) p2 (NOT p1)))]
Knowledge based reduction with 19 factoid took 2369 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 30 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:03:18] [INFO ] Invariant cache hit.
[2024-05-29 13:03:19] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-29 13:03:19] [INFO ] Invariant cache hit.
[2024-05-29 13:03:20] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
[2024-05-29 13:03:20] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 13:03:20] [INFO ] Invariant cache hit.
[2024-05-29 13:03:21] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2367 ms. Remains : 994/994 places, 716/716 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 p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 134 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 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 79 ms. (steps per millisecond=126 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 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 72 ms. (steps per millisecond=138 ) 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 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 13:03:22] [INFO ] Invariant cache hit.
[2024-05-29 13:03:22] [INFO ] [Real]Absence check using 438 positive place invariants in 79 ms returned sat
[2024-05-29 13:03:23] [INFO ] After 1062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:03:23] [INFO ] [Nat]Absence check using 438 positive place invariants in 76 ms returned sat
[2024-05-29 13:03:24] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 13:03:25] [INFO ] After 1212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 660 ms.
[2024-05-29 13:03:25] [INFO ] After 2320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 6 properties in 550 ms.
Support contains 6 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 155 times.
Drop transitions removed 155 transitions
Iterating global reduction 0 with 155 rules applied. Total rules applied 155 place count 994 transition count 716
Applied a total of 155 rules in 123 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 994/994 places, 716/716 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266008 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266008 steps, saw 255214 distinct states, run finished after 3003 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:03:29] [INFO ] Computed 438 invariants in 9 ms
[2024-05-29 13:03:29] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:03:30] [INFO ] [Nat]Absence check using 438 positive place invariants in 77 ms returned sat
[2024-05-29 13:03:30] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:03:30] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-29 13:03:30] [INFO ] After 208ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:03:30] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-29 13:03:30] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 38 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 994/994 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 58 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:03:30] [INFO ] Invariant cache hit.
[2024-05-29 13:03:31] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-29 13:03:31] [INFO ] Invariant cache hit.
[2024-05-29 13:03:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-29 13:03:33] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2741 ms to find 0 implicit places.
[2024-05-29 13:03:33] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 13:03:33] [INFO ] Invariant cache hit.
[2024-05-29 13:03:34] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3355 ms. Remains : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 994 transition count 716
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 994 transition count 677
Applied a total of 78 rules in 66 ms. Remains 994 /994 variables (removed 0) and now considering 677/716 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 677 rows 994 cols
[2024-05-29 13:03:34] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:03:34] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:03:34] [INFO ] [Nat]Absence check using 438 positive place invariants in 76 ms returned sat
[2024-05-29 13:03:35] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:03:35] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-29 13:03:35] [INFO ] After 813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p2) (NOT p0))), (F p0), (F (AND (NOT p3) p2 (NOT p0))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (F (AND (NOT p1) (NOT p3) p2 p0))]
Knowledge based reduction with 19 factoid took 361 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 22 reset in 717 ms.
Product exploration explored 100000 steps with 15 reset in 851 ms.
Built C files in :
/tmp/ltsmin2026473243592293227
[2024-05-29 13:03:37] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:03:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:37] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:03:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:38] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:03:38] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:38] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2026473243592293227
Running compilation step : cd /tmp/ltsmin2026473243592293227;'/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 1932 ms.
Running link step : cd /tmp/ltsmin2026473243592293227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin2026473243592293227;'/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/stateBased6765570008476199764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 23 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:03:52] [INFO ] Computed 438 invariants in 5 ms
[2024-05-29 13:03:53] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-29 13:03:53] [INFO ] Invariant cache hit.
[2024-05-29 13:03:54] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-05-29 13:03:54] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 13:03:54] [INFO ] Invariant cache hit.
[2024-05-29 13:03:55] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2439 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin12726708288094609855
[2024-05-29 13:03:55] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:03:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:55] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:03:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:55] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:03:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:55] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12726708288094609855
Running compilation step : cd /tmp/ltsmin12726708288094609855;'/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 1879 ms.
Running link step : cd /tmp/ltsmin12726708288094609855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12726708288094609855;'/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/stateBased17994673292120652647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:04:10] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:04:10] [INFO ] Flatten gal took : 47 ms
[2024-05-29 13:04:10] [INFO ] Time to serialize gal into /tmp/LTL12745473119526927217.gal : 7 ms
[2024-05-29 13:04:10] [INFO ] Time to serialize properties into /tmp/LTL9145234697731886112.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/LTL12745473119526927217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut155126791018979460.hoa' '-atoms' '/tmp/LTL9145234697731886112.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...317
Loading property file /tmp/LTL9145234697731886112.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut155126791018979460.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:04:25] [INFO ] Flatten gal took : 40 ms
[2024-05-29 13:04:25] [INFO ] Flatten gal took : 40 ms
[2024-05-29 13:04:25] [INFO ] Time to serialize gal into /tmp/LTL6051743297941298829.gal : 4 ms
[2024-05-29 13:04:25] [INFO ] Time to serialize properties into /tmp/LTL11825613607933162887.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/LTL6051743297941298829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11825613607933162887.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 : !(((X(F("((p556==1)&&(p571==1))")))U((G(("(p297==0)")U("(p749==0)")))||("((p282==1)&&(p284==1))"))))
Formula 0 simplified : XG!"((p556==1)&&(p571==1))" R (!"((p282==1)&&(p284==1))" & F(!"(p297==0)" R !"(p749==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:04:40] [INFO ] Flatten gal took : 39 ms
[2024-05-29 13:04:40] [INFO ] Applying decomposition
[2024-05-29 13:04:40] [INFO ] Flatten gal took : 37 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/graph17796365606478852888.txt' '-o' '/tmp/graph17796365606478852888.bin' '-w' '/tmp/graph17796365606478852888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17796365606478852888.bin' '-l' '-1' '-v' '-w' '/tmp/graph17796365606478852888.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:04:41] [INFO ] Decomposing Gal with order
[2024-05-29 13:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:04:41] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-29 13:04:41] [INFO ] Flatten gal took : 89 ms
[2024-05-29 13:04:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 60 ms.
[2024-05-29 13:04:41] [INFO ] Time to serialize gal into /tmp/LTL13454319734719366614.gal : 18 ms
[2024-05-29 13:04:41] [INFO ] Time to serialize properties into /tmp/LTL5866284272268774910.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/LTL13454319734719366614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5866284272268774910.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 : !(((X(F("((i12.u178.p556==1)&&(i13.i0.i0.u181.p571==1))")))U((G(("(i6.i0.i2.u94.p297==0)")U("(i16.i0.i0.u239.p749==0)")))||("((i6.i0.i...199
Formula 0 simplified : XG!"((i12.u178.p556==1)&&(i13.i0.i0.u181.p571==1))" R (!"((i6.i0.i2.u90.p282==1)&&(i6.i0.i2.u90.p284==1))" & F(!"(i6.i0.i2.u94.p297=...191
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10305000481402287350
[2024-05-29 13:04:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10305000481402287350
Running compilation step : cd /tmp/ltsmin10305000481402287350;'/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 1203 ms.
Running link step : cd /tmp/ltsmin10305000481402287350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10305000481402287350;'/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' '(X(<>((LTLAPp0==true))) U ([](((LTLAPp1==true) U (LTLAPp2==true)))||(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040A-LTLFireability-04 finished in 125230 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 U (p1||G(p0))))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 721
Applied a total of 2 rules in 39 ms. Remains 1002 /1003 variables (removed 1) and now considering 721/722 (removed 1) transitions.
// Phase 1: matrix 721 rows 1002 cols
[2024-05-29 13:05:11] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 13:05:12] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-29 13:05:12] [INFO ] Invariant cache hit.
[2024-05-29 13:05:13] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2024-05-29 13:05:13] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 13:05:13] [INFO ] Invariant cache hit.
[2024-05-29 13:05:14] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/1003 places, 721/722 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2413 ms. Remains : 1002/1003 places, 721/722 transitions.
Stuttering acceptance computed with spot in 2581 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s138 1) (EQ s152 1) (OR (EQ s724 1) (AND (EQ s986 1) (EQ s995 1)))), p0:(AND (EQ s138 1) (EQ s152 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 0 reset in 680 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-05 finished in 5704 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(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1000 transition count 720
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 1000 transition count 718
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 998 transition count 718
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 997 transition count 717
Applied a total of 9 rules in 62 ms. Remains 997 /1003 variables (removed 6) and now considering 717/722 (removed 5) transitions.
// Phase 1: matrix 717 rows 997 cols
[2024-05-29 13:05:17] [INFO ] Computed 440 invariants in 2 ms
[2024-05-29 13:05:17] [INFO ] Implicit Places using invariants in 602 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 607 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1003 places, 717/722 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 993 transition count 715
Applied a total of 4 rules in 33 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2024-05-29 13:05:17] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:05:18] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 13:05:18] [INFO ] Invariant cache hit.
[2024-05-29 13:05:19] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1003 places, 715/722 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2348 ms. Remains : 993/1003 places, 715/722 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s800 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 652 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-07 finished in 3060 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(X(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:05:20] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 13:05:20] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-29 13:05:20] [INFO ] Invariant cache hit.
[2024-05-29 13:05:22] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2024-05-29 13:05:22] [INFO ] Invariant cache hit.
[2024-05-29 13:05:22] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2352 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 3860 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s576 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-09 finished in 6238 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) U p1))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 35 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:05:26] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 13:05:27] [INFO ] Implicit Places using invariants in 579 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 581 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 27 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:05:27] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:05:27] [INFO ] Implicit Places using invariants in 626 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 627 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 39 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:05:27] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:05:28] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-29 13:05:28] [INFO ] Invariant cache hit.
[2024-05-29 13:05:29] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3052 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s979 1) (EQ s989 1)), p0:(AND (EQ s778 1) (EQ s801 1))], nbAcceptance=0, 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 65 reset in 648 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-10 finished in 3782 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' '!((p0 U X((!p1&&(G(!p2) U p0)))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:05:30] [INFO ] Computed 441 invariants in 2 ms
[2024-05-29 13:05:30] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-29 13:05:30] [INFO ] Invariant cache hit.
[2024-05-29 13:05:32] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-29 13:05:32] [INFO ] Invariant cache hit.
[2024-05-29 13:05:32] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2332 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 240 ms :[p2, (OR (NOT p0) p2), (OR (NOT p0) (AND p1 p2)), true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(OR (AND (NOT p0) p2) p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(AND (EQ s657 1) (EQ s659 1)), p0:(AND (EQ s362 1) (EQ s364 1)), p1:(AND (EQ s936 1) (EQ s946 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 692 ms.
Stack based approach found an accepted trace after 116 steps with 0 reset with depth 117 and stack size 117 in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLFireability-11 finished in 3296 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 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 35 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:05:33] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 13:05:34] [INFO ] Implicit Places using invariants in 601 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 604 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 23 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:05:34] [INFO ] Computed 440 invariants in 2 ms
[2024-05-29 13:05:34] [INFO ] Implicit Places using invariants in 648 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 650 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 32 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:05:35] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:05:35] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-29 13:05:35] [INFO ] Invariant cache hit.
[2024-05-29 13:05:36] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3203 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s440 0) (EQ s474 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 649 ms.
Product exploration explored 100000 steps with 0 reset in 881 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 81 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 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9551 steps, run visited all 1 properties in 90 ms. (steps per millisecond=106 )
Probabilistic random walk after 9551 steps, saw 9307 distinct states, run finished after 91 ms. (steps per millisecond=104 ) 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 172 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)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 23 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:05:39] [INFO ] Invariant cache hit.
[2024-05-29 13:05:39] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 13:05:39] [INFO ] Invariant cache hit.
[2024-05-29 13:05:41] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2024-05-29 13:05:41] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 13:05:41] [INFO ] Invariant cache hit.
[2024-05-29 13:05:41] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2402 ms. Remains : 994/994 places, 716/716 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 76 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 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9551 steps, run visited all 1 properties in 88 ms. (steps per millisecond=108 )
Probabilistic random walk after 9551 steps, saw 9307 distinct states, run finished after 89 ms. (steps per millisecond=107 ) 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 109 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 :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 645 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Built C files in :
/tmp/ltsmin1404473918221735757
[2024-05-29 13:05:43] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:05:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:05:43] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:05:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:05:44] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:05:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:05:44] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1404473918221735757
Running compilation step : cd /tmp/ltsmin1404473918221735757;'/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 1805 ms.
Running link step : cd /tmp/ltsmin1404473918221735757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1404473918221735757;'/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/stateBased6893284321734478152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 20 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:05:59] [INFO ] Invariant cache hit.
[2024-05-29 13:05:59] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-29 13:05:59] [INFO ] Invariant cache hit.
[2024-05-29 13:06:00] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2024-05-29 13:06:00] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 13:06:00] [INFO ] Invariant cache hit.
[2024-05-29 13:06:01] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2283 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin9328746133548959979
[2024-05-29 13:06:01] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:06:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:06:01] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:06:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:06:01] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:06:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:06:01] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9328746133548959979
Running compilation step : cd /tmp/ltsmin9328746133548959979;'/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 1827 ms.
Running link step : cd /tmp/ltsmin9328746133548959979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9328746133548959979;'/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/stateBased12870445856916292344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:06:16] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:06:16] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:06:16] [INFO ] Time to serialize gal into /tmp/LTL7339328998015098187.gal : 5 ms
[2024-05-29 13:06:16] [INFO ] Time to serialize properties into /tmp/LTL1846331187297001426.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/LTL7339328998015098187.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10309245398434646112.hoa' '-atoms' '/tmp/LTL1846331187297001426.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/LTL1846331187297001426.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10309245398434646112.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1060 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,10.6815,235000,1,0,8,1.24155e+06,24,0,24255,562659,28
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040A-LTLFireability-12 finished in 54360 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(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:06:28] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 13:06:28] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-29 13:06:28] [INFO ] Invariant cache hit.
[2024-05-29 13:06:29] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2024-05-29 13:06:29] [INFO ] Invariant cache hit.
[2024-05-29 13:06:30] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2263 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s386 1) (NEQ s396 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 645 ms.
Product exploration explored 100000 steps with 0 reset in 820 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25225 steps, run visited all 1 properties in 228 ms. (steps per millisecond=110 )
Probabilistic random walk after 25225 steps, saw 24687 distinct states, run finished after 229 ms. (steps per millisecond=110 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLFireability-14 finished in 4462 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((X(p0)||G(p1)))))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:06:32] [INFO ] Invariant cache hit.
[2024-05-29 13:06:33] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-29 13:06:33] [INFO ] Invariant cache hit.
[2024-05-29 13:06:34] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2024-05-29 13:06:34] [INFO ] Invariant cache hit.
[2024-05-29 13:06:34] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2303 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s326 0), p0:(AND (EQ s415 1) (EQ s449 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 657 ms.
Product exploration explored 100000 steps with 0 reset in 829 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Finished probabilistic random walk after 26672 steps, run visited all 2 properties in 498 ms. (steps per millisecond=53 )
Probabilistic random walk after 26672 steps, saw 26120 distinct states, run finished after 500 ms. (steps per millisecond=53 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:06:37] [INFO ] Invariant cache hit.
[2024-05-29 13:06:38] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-29 13:06:38] [INFO ] Invariant cache hit.
[2024-05-29 13:06:39] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
[2024-05-29 13:06:39] [INFO ] Invariant cache hit.
[2024-05-29 13:06:40] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2336 ms. Remains : 1003/1003 places, 722/722 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) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished probabilistic random walk after 26672 steps, run visited all 2 properties in 369 ms. (steps per millisecond=72 )
Probabilistic random walk after 26672 steps, saw 26120 distinct states, run finished after 370 ms. (steps per millisecond=72 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 659 ms.
Product exploration explored 100000 steps with 0 reset in 854 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 722
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 107 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:06:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:06:43] [INFO ] Computed 441 invariants in 2 ms
[2024-05-29 13:06:43] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 722/722 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 1003/1003 places, 722/722 transitions.
Built C files in :
/tmp/ltsmin9608378590208666114
[2024-05-29 13:06:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9608378590208666114
Running compilation step : cd /tmp/ltsmin9608378590208666114;'/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 1225 ms.
Running link step : cd /tmp/ltsmin9608378590208666114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9608378590208666114;'/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' '--hoa' '/tmp/stateBased4292046976118695492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 22 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:06:58] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 13:06:59] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-29 13:06:59] [INFO ] Invariant cache hit.
[2024-05-29 13:07:00] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2024-05-29 13:07:00] [INFO ] Invariant cache hit.
[2024-05-29 13:07:01] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2319 ms. Remains : 1003/1003 places, 722/722 transitions.
Built C files in :
/tmp/ltsmin10439775343990106261
[2024-05-29 13:07:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10439775343990106261
Running compilation step : cd /tmp/ltsmin10439775343990106261;'/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 1248 ms.
Running link step : cd /tmp/ltsmin10439775343990106261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10439775343990106261;'/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' '--hoa' '/tmp/stateBased1801184213156368117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:07:16] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:07:16] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:07:16] [INFO ] Time to serialize gal into /tmp/LTL17374940672743270105.gal : 4 ms
[2024-05-29 13:07:16] [INFO ] Time to serialize properties into /tmp/LTL16167470356590848846.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/LTL17374940672743270105.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8143834473352954308.hoa' '-atoms' '/tmp/LTL16167470356590848846.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/LTL16167470356590848846.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8143834473352954308.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:07:31] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:07:31] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:07:31] [INFO ] Time to serialize gal into /tmp/LTL13689057870953615426.gal : 5 ms
[2024-05-29 13:07:31] [INFO ] Time to serialize properties into /tmp/LTL14483340647299340832.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/LTL13689057870953615426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14483340647299340832.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 : !((X(F((X("((p415==1)&&(p449==1))"))||(G("(p326==0)"))))))
Formula 0 simplified : XG(X!"((p415==1)&&(p449==1))" & F!"(p326==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:07:46] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:07:46] [INFO ] Applying decomposition
[2024-05-29 13:07:46] [INFO ] Flatten gal took : 28 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/graph18280144546319854266.txt' '-o' '/tmp/graph18280144546319854266.bin' '-w' '/tmp/graph18280144546319854266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18280144546319854266.bin' '-l' '-1' '-v' '-w' '/tmp/graph18280144546319854266.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:07:46] [INFO ] Decomposing Gal with order
[2024-05-29 13:07:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:07:46] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 13:07:46] [INFO ] Flatten gal took : 44 ms
[2024-05-29 13:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 52 ms.
[2024-05-29 13:07:46] [INFO ] Time to serialize gal into /tmp/LTL10935801563234032769.gal : 14 ms
[2024-05-29 13:07:46] [INFO ] Time to serialize properties into /tmp/LTL9292924389263244499.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/LTL10935801563234032769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9292924389263244499.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 : !((X(F((X("((i7.i2.i0.u132.p415==1)&&(i7.i2.i0.u143.p449==1))"))||(G("(i4.i1.i0.u104.p326==0)"))))))
Formula 0 simplified : XG(X!"((i7.i2.i0.u132.p415==1)&&(i7.i2.i0.u143.p449==1))" & F!"(i4.i1.i0.u104.p326==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3330561326577248262
[2024-05-29 13:08:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3330561326577248262
Running compilation step : cd /tmp/ltsmin3330561326577248262;'/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 1274 ms.
Running link step : cd /tmp/ltsmin3330561326577248262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3330561326577248262;'/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' 'X(<>((X((LTLAPp0==true))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040A-LTLFireability-15 finished in 104675 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)) U (p1||G((p2 U p3)))))'
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((X(p0)||G(p1)))))'
Found a Shortening insensitive property : ShieldPPPt-PT-040A-LTLFireability-15
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 43 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:08:17] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 13:08:18] [INFO ] Implicit Places using invariants in 645 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 25 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:08:18] [INFO ] Computed 440 invariants in 6 ms
[2024-05-29 13:08:18] [INFO ] Implicit Places using invariants in 628 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 630 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 36 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:08:18] [INFO ] Computed 438 invariants in 5 ms
[2024-05-29 13:08:19] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-29 13:08:19] [INFO ] Invariant cache hit.
[2024-05-29 13:08:20] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3235 ms. Remains : 994/1003 places, 716/722 transitions.
Running random walk in product with property : ShieldPPPt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s326 0), p0:(AND (EQ s415 1) (EQ s449 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 638 ms.
Product exploration explored 100000 steps with 0 reset in 819 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Finished probabilistic random walk after 26211 steps, run visited all 2 properties in 466 ms. (steps per millisecond=56 )
Probabilistic random walk after 26211 steps, saw 25639 distinct states, run finished after 470 ms. (steps per millisecond=55 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 18 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:08:23] [INFO ] Invariant cache hit.
[2024-05-29 13:08:24] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-29 13:08:24] [INFO ] Invariant cache hit.
[2024-05-29 13:08:25] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2024-05-29 13:08:25] [INFO ] Invariant cache hit.
[2024-05-29 13:08:25] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2172 ms. Remains : 994/994 places, 716/716 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) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Finished probabilistic random walk after 26211 steps, run visited all 2 properties in 344 ms. (steps per millisecond=76 )
Probabilistic random walk after 26211 steps, saw 25639 distinct states, run finished after 347 ms. (steps per millisecond=75 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 659 ms.
Product exploration explored 100000 steps with 0 reset in 874 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 24 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:08:28] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 13:08:28] [INFO ] Invariant cache hit.
[2024-05-29 13:08:29] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin3506725174731770889
[2024-05-29 13:08:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3506725174731770889
Running compilation step : cd /tmp/ltsmin3506725174731770889;'/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 1247 ms.
Running link step : cd /tmp/ltsmin3506725174731770889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3506725174731770889;'/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' '--hoa' '/tmp/stateBased12492846476325200152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 994 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 19 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:08:44] [INFO ] Invariant cache hit.
[2024-05-29 13:08:44] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-29 13:08:44] [INFO ] Invariant cache hit.
[2024-05-29 13:08:45] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2024-05-29 13:08:45] [INFO ] Invariant cache hit.
[2024-05-29 13:08:46] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2371 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin14341728863292580113
[2024-05-29 13:08:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14341728863292580113
Running compilation step : cd /tmp/ltsmin14341728863292580113;'/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 1267 ms.
Running link step : cd /tmp/ltsmin14341728863292580113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14341728863292580113;'/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' '--hoa' '/tmp/stateBased4804392484505320307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:09:01] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:09:01] [INFO ] Flatten gal took : 42 ms
[2024-05-29 13:09:01] [INFO ] Time to serialize gal into /tmp/LTL14838670556369386567.gal : 4 ms
[2024-05-29 13:09:01] [INFO ] Time to serialize properties into /tmp/LTL1791509460134295179.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/LTL14838670556369386567.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11021526001954250940.hoa' '-atoms' '/tmp/LTL1791509460134295179.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/LTL1791509460134295179.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11021526001954250940.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:09:16] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:09:16] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:09:16] [INFO ] Time to serialize gal into /tmp/LTL12386242122850932221.gal : 7 ms
[2024-05-29 13:09:16] [INFO ] Time to serialize properties into /tmp/LTL18289455714878716008.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/LTL12386242122850932221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18289455714878716008.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 : !((X(F((X("((p415==1)&&(p449==1))"))||(G("(p326==0)"))))))
Formula 0 simplified : XG(X!"((p415==1)&&(p449==1))" & F!"(p326==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:09:31] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:09:31] [INFO ] Applying decomposition
[2024-05-29 13:09:32] [INFO ] Flatten gal took : 27 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/graph15932072307723197931.txt' '-o' '/tmp/graph15932072307723197931.bin' '-w' '/tmp/graph15932072307723197931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15932072307723197931.bin' '-l' '-1' '-v' '-w' '/tmp/graph15932072307723197931.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:09:32] [INFO ] Decomposing Gal with order
[2024-05-29 13:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:09:32] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-29 13:09:32] [INFO ] Flatten gal took : 37 ms
[2024-05-29 13:09:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 40 ms.
[2024-05-29 13:09:32] [INFO ] Time to serialize gal into /tmp/LTL16852473351206046742.gal : 13 ms
[2024-05-29 13:09:32] [INFO ] Time to serialize properties into /tmp/LTL14573881790448246196.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/LTL16852473351206046742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14573881790448246196.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((i9.i0.i3.u132.p415==1)&&(i9.i0.i3.u143.p449==1))"))||(G("(i6.i0.i2.u104.p326==0)"))))))
Formula 0 simplified : XG(X!"((i9.i0.i3.u132.p415==1)&&(i9.i0.i3.u143.p449==1))" & F!"(i6.i0.i2.u104.p326==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3312471676784855059
[2024-05-29 13:09:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3312471676784855059
Running compilation step : cd /tmp/ltsmin3312471676784855059;'/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 1220 ms.
Running link step : cd /tmp/ltsmin3312471676784855059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3312471676784855059;'/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' 'X(<>((X((LTLAPp0==true))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040A-LTLFireability-15 finished in 105147 ms.
[2024-05-29 13:10:02] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8415547460152846601
[2024-05-29 13:10:02] [INFO ] Applying decomposition
[2024-05-29 13:10:02] [INFO ] Computing symmetric may disable matrix : 722 transitions.
[2024-05-29 13:10:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:10:02] [INFO ] Computing symmetric may enable matrix : 722 transitions.
[2024-05-29 13:10:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:10:02] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:10:02] [INFO ] Computing Do-Not-Accords matrix : 722 transitions.
[2024-05-29 13:10:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph6651456519115643833.txt' '-o' '/tmp/graph6651456519115643833.bin' '-w' '/tmp/graph6651456519115643833.weights'
[2024-05-29 13:10:02] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8415547460152846601
Running compilation step : cd /tmp/ltsmin8415547460152846601;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6651456519115643833.bin' '-l' '-1' '-v' '-w' '/tmp/graph6651456519115643833.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:10:02] [INFO ] Decomposing Gal with order
[2024-05-29 13:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:10:02] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 13:10:02] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 23 ms.
[2024-05-29 13:10:02] [INFO ] Time to serialize gal into /tmp/LTLFireability8570702941092972276.gal : 12 ms
[2024-05-29 13:10:02] [INFO ] Time to serialize properties into /tmp/LTLFireability7878921150359732457.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/LTLFireability8570702941092972276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7878921150359732457.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...276
Read 2 LTL properties
Checking formula 0 : !(((X(F("((i11.i0.i2.u178.p556==1)&&(i11.i1.i0.u181.p571==1))")))U(("((i5.i1.i2.u90.p282==1)&&(i5.i1.i2.u90.p284==1))")||(G(("(i5.i1.i...205
Formula 0 simplified : XG!"((i11.i0.i2.u178.p556==1)&&(i11.i1.i0.u181.p571==1))" R (!"((i5.i1.i2.u90.p282==1)&&(i5.i1.i2.u90.p284==1))" & F(!"(i5.i1.i2.u94...197
Compilation finished in 1903 ms.
Running link step : cd /tmp/ltsmin8415547460152846601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8415547460152846601;'/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' '(X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||[](((LTLAPp2==true) U (LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 50746 ms.
FORMULA ShieldPPPt-PT-040A-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8415547460152846601;'/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' 'X(<>((X((LTLAPp4==true))||[]((LTLAPp5==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.062: LTL layer: formula: X(<>((X((LTLAPp4==true))||[]((LTLAPp5==true)))))
pins2lts-mc-linux64( 7/ 8), 0.062: "X(<>((X((LTLAPp4==true))||[]((LTLAPp5==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.063: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.249: There are 729 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.249: State length is 1004, there are 728 groups
pins2lts-mc-linux64( 0/ 8), 0.249: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.249: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.249: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.249: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.310: [Blue] ~120 levels ~960 states ~5456 transitions
pins2lts-mc-linux64( 0/ 8), 0.363: [Blue] ~240 levels ~1920 states ~11072 transitions
pins2lts-mc-linux64( 0/ 8), 0.523: [Blue] ~480 levels ~3840 states ~25240 transitions
pins2lts-mc-linux64( 0/ 8), 0.828: [Blue] ~960 levels ~7680 states ~54056 transitions
pins2lts-mc-linux64( 2/ 8), 1.279: [Blue] ~1906 levels ~15360 states ~90184 transitions
pins2lts-mc-linux64( 2/ 8), 2.028: [Blue] ~3816 levels ~30720 states ~185200 transitions
pins2lts-mc-linux64( 2/ 8), 3.269: [Blue] ~7636 levels ~61440 states ~384000 transitions
pins2lts-mc-linux64( 2/ 8), 5.532: [Blue] ~15272 levels ~122880 states ~761680 transitions
pins2lts-mc-linux64( 2/ 8), 9.579: [Blue] ~30553 levels ~245760 states ~1566176 transitions
pins2lts-mc-linux64( 2/ 8), 17.177: [Blue] ~61155 levels ~491520 states ~3212792 transitions
pins2lts-mc-linux64( 2/ 8), 32.272: [Blue] ~122376 levels ~983040 states ~6692256 transitions
pins2lts-mc-linux64( 2/ 8), 62.870: [Blue] ~244916 levels ~1966080 states ~13932368 transitions
pins2lts-mc-linux64( 2/ 8), 108.976: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 109.220:
pins2lts-mc-linux64( 0/ 8), 109.220: Explored 3126490 states 25726207 transitions, fanout: 8.228
pins2lts-mc-linux64( 0/ 8), 109.220: Total exploration time 108.960 sec (108.690 sec minimum, 108.842 sec on average)
pins2lts-mc-linux64( 0/ 8), 109.220: States per second: 28694, Transitions per second: 236107
pins2lts-mc-linux64( 0/ 8), 109.220:
pins2lts-mc-linux64( 0/ 8), 109.220: State space has 15140828 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 109.220: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 109.220: blue states: 3126490 (20.65%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 109.220: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 109.220: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 109.220:
pins2lts-mc-linux64( 0/ 8), 109.220: Total memory used for local state coloring: 47.6MB
pins2lts-mc-linux64( 0/ 8), 109.220:
pins2lts-mc-linux64( 0/ 8), 109.220: Queue width: 8B, total height: 3118906, memory: 23.80MB
pins2lts-mc-linux64( 0/ 8), 109.220: Tree memory: 371.5MB, 25.7 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 109.220: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 109.220: Stored 730 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 109.220: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 109.220: Est. total memory use: 395.3MB (~1047.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8415547460152846601;'/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' 'X(<>((X((LTLAPp4==true))||[]((LTLAPp5==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8415547460152846601;'/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' 'X(<>((X((LTLAPp4==true))||[]((LTLAPp5==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:32:32] [INFO ] Applying decomposition
[2024-05-29 13:32:32] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:32:32] [INFO ] Decomposing Gal with order
[2024-05-29 13:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:32:32] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 13:32:32] [INFO ] Flatten gal took : 43 ms
[2024-05-29 13:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-29 13:32:32] [INFO ] Time to serialize gal into /tmp/LTLFireability13929213543833244750.gal : 13 ms
[2024-05-29 13:32:32] [INFO ] Time to serialize properties into /tmp/LTLFireability11037370741575672157.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/LTLFireability13929213543833244750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11037370741575672157.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...278
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((i132.u597.p415==1)&&(u252.p449==1))"))||(G("(u183.p326==0)"))))))
Formula 0 simplified : XG(X!"((i132.u597.p415==1)&&(u252.p449==1))" & F!"(u183.p326==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
3124 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,31.3628,941584,1,0,2.1096e+06,1101,9375,3.28124e+06,45,842,382122
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1829691 ms.

BK_STOP 1716989584957

--------------------
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-040A"
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-040A, 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-171683789200413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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