Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 370K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653056544649

Running Version 202205111006
[2022-05-20 14:22:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 14:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 14:22:26] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-20 14:22:26] [INFO ] Transformed 1203 places.
[2022-05-20 14:22:26] [INFO ] Transformed 1353 transitions.
[2022-05-20 14:22:26] [INFO ] Found NUPN structural information;
[2022-05-20 14:22:26] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Discarding 196 places :
Symmetric choice reduction at 0 with 196 rule applications. Total rules 196 place count 1007 transition count 1157
Iterating global reduction 0 with 196 rules applied. Total rules applied 392 place count 1007 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 393 place count 1006 transition count 1156
Iterating global reduction 0 with 1 rules applied. Total rules applied 394 place count 1006 transition count 1156
Applied a total of 394 rules in 203 ms. Remains 1006 /1203 variables (removed 197) and now considering 1156/1353 (removed 197) transitions.
// Phase 1: matrix 1156 rows 1006 cols
[2022-05-20 14:22:26] [INFO ] Computed 121 place invariants in 30 ms
[2022-05-20 14:22:26] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 1156 rows 1006 cols
[2022-05-20 14:22:26] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:22:27] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
// Phase 1: matrix 1156 rows 1006 cols
[2022-05-20 14:22:27] [INFO ] Computed 121 place invariants in 21 ms
[2022-05-20 14:22:28] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1203 places, 1156/1353 transitions.
Finished structural reductions, in 1 iterations. Remains : 1006/1203 places, 1156/1353 transitions.
Support contains 33 out of 1006 places after structural reductions.
[2022-05-20 14:22:28] [INFO ] Flatten gal took : 124 ms
[2022-05-20 14:22:28] [INFO ] Flatten gal took : 69 ms
[2022-05-20 14:22:28] [INFO ] Input system was already deterministic with 1156 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1156 rows 1006 cols
[2022-05-20 14:22:29] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 14:22:29] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 14:22:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2022-05-20 14:22:29] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA ShieldRVs-PT-030B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 251 stabilizing places and 251 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0)||F(p1)||p2))))'
Support contains 6 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 996 transition count 1146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 996 transition count 1146
Applied a total of 20 rules in 38 ms. Remains 996 /1006 variables (removed 10) and now considering 1146/1156 (removed 10) transitions.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:30] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:22:30] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:30] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:22:31] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:31] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:22:31] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 996/1006 places, 1146/1156 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/1006 places, 1146/1156 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s282 0) (EQ s236 1)), p2:(AND (EQ s547 0) (EQ s53 1)), p0:(AND (EQ s713 0) (EQ s865 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 461 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 242 stabilizing places and 242 stable transitions
Computed a total of 242 stabilizing places and 242 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-030B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-030B-LTLCardinality-00 finished in 2770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X(p2)))'
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 996 transition count 1146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 996 transition count 1146
Applied a total of 20 rules in 40 ms. Remains 996 /1006 variables (removed 10) and now considering 1146/1156 (removed 10) transitions.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:32] [INFO ] Computed 121 place invariants in 11 ms
[2022-05-20 14:22:33] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:33] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:22:33] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:33] [INFO ] Computed 121 place invariants in 12 ms
[2022-05-20 14:22:34] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 996/1006 places, 1146/1156 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/1006 places, 1146/1156 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s267 0) (EQ s206 1)), p0:(OR (EQ s809 0) (EQ s367 1)), p2:(AND (NOT (OR (EQ s809 0) (EQ s367 1))) (OR (EQ s267 0) (EQ s206 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30923 reset in 246 ms.
Product exploration explored 100000 steps with 30884 reset in 291 ms.
Computed a total of 242 stabilizing places and 242 stable transitions
Computed a total of 242 stabilizing places and 242 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 787 ms. Reduced automaton from 9 states, 20 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:36] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:22:36] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 14:22:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2022-05-20 14:22:37] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 14:22:37] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2022-05-20 14:22:37] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 1 ms to minimize.
[2022-05-20 14:22:38] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 1 ms to minimize.
[2022-05-20 14:22:38] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2022-05-20 14:22:38] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2022-05-20 14:22:38] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2022-05-20 14:22:38] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
[2022-05-20 14:22:39] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 0 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2022-05-20 14:22:40] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 0 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 0 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2022-05-20 14:22:41] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 4 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2022-05-20 14:22:42] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 1 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 0 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 0 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 5862 ms
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 0 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2022-05-20 14:22:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 608 ms
[2022-05-20 14:22:44] [INFO ] After 7094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-05-20 14:22:44] [INFO ] After 7432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 101 ms.
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 996 transition count 1025
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 875 transition count 1025
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 242 place count 875 transition count 877
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 538 place count 727 transition count 877
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1138 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1200 place count 427 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1201 place count 426 transition count 576
Applied a total of 1201 rules in 188 ms. Remains 426 /996 variables (removed 570) and now considering 576/1146 (removed 570) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/996 places, 576/1146 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :2
Finished Best-First random walk after 5178 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=470 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 17 factoid took 1066 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:22:46] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:22:46] [INFO ] [Real]Absence check using 121 positive place invariants in 67 ms returned sat
[2022-05-20 14:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:22:48] [INFO ] [Real]Absence check using state equation in 1921 ms returned sat
[2022-05-20 14:22:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:22:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 73 ms returned sat
[2022-05-20 14:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:22:51] [INFO ] [Nat]Absence check using state equation in 2163 ms returned sat
[2022-05-20 14:22:51] [INFO ] Computed and/alt/rep : 1145/3621/1145 causal constraints (skipped 0 transitions) in 62 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 14:23:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Applied a total of 0 rules in 16 ms. Remains 996 /996 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:23:03] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 14:23:03] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:23:03] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:23:04] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:23:04] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:23:05] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 996/996 places, 1146/1146 transitions.
Computed a total of 242 stabilizing places and 242 stable transitions
Computed a total of 242 stabilizing places and 242 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p1)), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 670 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:23:06] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:23:06] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 14:23:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2022-05-20 14:23:07] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 14:23:07] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2022-05-20 14:23:07] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 0 ms to minimize.
[2022-05-20 14:23:07] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2022-05-20 14:23:07] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 1 ms to minimize.
[2022-05-20 14:23:08] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2022-05-20 14:23:08] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2022-05-20 14:23:08] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2022-05-20 14:23:08] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2022-05-20 14:23:08] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 3 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 1 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 0 ms to minimize.
[2022-05-20 14:23:09] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 0 ms to minimize.
[2022-05-20 14:23:10] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 0 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 0 ms to minimize.
[2022-05-20 14:23:11] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 0 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2022-05-20 14:23:12] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 5595 ms
[2022-05-20 14:23:12] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2022-05-20 14:23:13] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2022-05-20 14:23:13] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2022-05-20 14:23:13] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2022-05-20 14:23:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 573 ms
[2022-05-20 14:23:13] [INFO ] After 6800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-20 14:23:13] [INFO ] After 7140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 996 transition count 1025
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 875 transition count 1025
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 242 place count 875 transition count 877
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 538 place count 727 transition count 877
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1138 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 1200 place count 427 transition count 577
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1201 place count 426 transition count 576
Applied a total of 1201 rules in 97 ms. Remains 426 /996 variables (removed 570) and now considering 576/1146 (removed 570) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/996 places, 576/1146 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Finished Best-First random walk after 2659 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=443 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p1)), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 714 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
// Phase 1: matrix 1146 rows 996 cols
[2022-05-20 14:23:15] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:23:15] [INFO ] [Real]Absence check using 121 positive place invariants in 68 ms returned sat
[2022-05-20 14:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:23:17] [INFO ] [Real]Absence check using state equation in 1936 ms returned sat
[2022-05-20 14:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:23:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 72 ms returned sat
[2022-05-20 14:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:23:20] [INFO ] [Nat]Absence check using state equation in 2124 ms returned sat
[2022-05-20 14:23:20] [INFO ] Computed and/alt/rep : 1145/3621/1145 causal constraints (skipped 0 transitions) in 55 ms.
[2022-05-20 14:23:32] [INFO ] Deduced a trap composed of 34 places in 343 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 14:23:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 110 reset in 457 ms.
Product exploration explored 100000 steps with 106 reset in 447 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (NOT p1), (AND p0 (NOT p1))]
Support contains 4 out of 996 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 996/996 places, 1146/1146 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 996 transition count 1146
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 120 place count 996 transition count 1174
Deduced a syphon composed of 179 places in 1 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 179 place count 996 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 995 transition count 1173
Deduced a syphon composed of 178 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 995 transition count 1173
Performed 390 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 1 with 390 rules applied. Total rules applied 571 place count 995 transition count 1173
Renaming transitions due to excessive name length > 1024 char.
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 781 place count 785 transition count 963
Deduced a syphon composed of 358 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 991 place count 785 transition count 963
Deduced a syphon composed of 358 places in 1 ms
Applied a total of 991 rules in 380 ms. Remains 785 /996 variables (removed 211) and now considering 963/1146 (removed 183) transitions.
[2022-05-20 14:23:34] [INFO ] Redundant transitions in 147 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 785 cols
[2022-05-20 14:23:34] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:23:35] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 785/996 places, 962/1146 transitions.
Deduced a syphon composed of 358 places in 1 ms
Applied a total of 0 rules in 33 ms. Remains 785 /785 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 785/996 places, 962/1146 transitions.
Entered a terminal (fully accepting) state of product in 2929 steps with 11 reset in 25 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLCardinality-01 finished in 62586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1005 transition count 1034
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 884 transition count 1034
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 884 transition count 884
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 734 transition count 884
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 556 place count 720 transition count 870
Iterating global reduction 2 with 14 rules applied. Total rules applied 570 place count 720 transition count 870
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 570 place count 720 transition count 862
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 586 place count 712 transition count 862
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: 288
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1162 place count 424 transition count 574
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1164 place count 422 transition count 572
Applied a total of 1164 rules in 114 ms. Remains 422 /1006 variables (removed 584) and now considering 572/1156 (removed 584) transitions.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 14:23:35] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:23:35] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 14:23:35] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 14:23:35] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2022-05-20 14:23:36] [INFO ] Redundant transitions in 82 ms returned [571]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 571 rows 422 cols
[2022-05-20 14:23:36] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:23:36] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 422/1006 places, 571/1156 transitions.
Applied a total of 0 rules in 11 ms. Remains 422 /422 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 422/1006 places, 571/1156 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-03 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 s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 388 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLCardinality-03 finished in 981 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(F(p0)))))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1005 transition count 1036
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 886 transition count 1036
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 238 place count 886 transition count 886
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 538 place count 736 transition count 886
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 550 place count 724 transition count 874
Iterating global reduction 2 with 12 rules applied. Total rules applied 562 place count 724 transition count 874
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 562 place count 724 transition count 868
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 574 place count 718 transition count 868
Performed 291 Post agglomeration using F-continuation condition.Transition count delta: 291
Deduced a syphon composed of 291 places in 1 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 2 with 582 rules applied. Total rules applied 1156 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1158 place count 425 transition count 575
Applied a total of 1158 rules in 101 ms. Remains 425 /1006 variables (removed 581) and now considering 575/1156 (removed 581) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:23:36] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:23:36] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:23:36] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:23:36] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2022-05-20 14:23:37] [INFO ] Redundant transitions in 93 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:37] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:23:37] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1006 places, 574/1156 transitions.
Applied a total of 0 rules in 10 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/1006 places, 574/1156 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-04 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 s139 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 627 reset in 372 ms.
Product exploration explored 100000 steps with 589 reset in 424 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/425 stabilizing places and 4/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 21 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:38] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:23:38] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:38] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:23:39] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2022-05-20 14:23:39] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:39] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:23:39] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/425 stabilizing places and 4/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 451 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=112 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 616 reset in 356 ms.
Product exploration explored 100000 steps with 649 reset in 404 ms.
Built C files in :
/tmp/ltsmin3657654681264398081
[2022-05-20 14:23:41] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:23:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:41] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:23:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:41] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:23:41] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:41] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3657654681264398081
Running compilation step : cd /tmp/ltsmin3657654681264398081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1833 ms.
Running link step : cd /tmp/ltsmin3657654681264398081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3657654681264398081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9527993278925121463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:56] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:23:56] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:56] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:23:56] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2022-05-20 14:23:56] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:23:56] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:23:57] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin16910823021097850215
[2022-05-20 14:23:57] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:23:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:57] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:23:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:57] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:23:57] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:23:57] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16910823021097850215
Running compilation step : cd /tmp/ltsmin16910823021097850215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1353 ms.
Running link step : cd /tmp/ltsmin16910823021097850215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16910823021097850215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17699536861032241983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:24:12] [INFO ] Flatten gal took : 32 ms
[2022-05-20 14:24:12] [INFO ] Flatten gal took : 29 ms
[2022-05-20 14:24:12] [INFO ] Time to serialize gal into /tmp/LTL2406806441910220073.gal : 6 ms
[2022-05-20 14:24:12] [INFO ] Time to serialize properties into /tmp/LTL4095036851551816487.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2406806441910220073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4095036851551816487.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2406806...266
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(G(F("((p411==0)||(p539==1))"))))))))
Formula 0 simplified : !GXFXGF"((p411==0)||(p539==1))"
Detected timeout of ITS tools.
[2022-05-20 14:24:27] [INFO ] Flatten gal took : 62 ms
[2022-05-20 14:24:27] [INFO ] Applying decomposition
[2022-05-20 14:24:27] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15081892718299673984.txt' '-o' '/tmp/graph15081892718299673984.bin' '-w' '/tmp/graph15081892718299673984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15081892718299673984.bin' '-l' '-1' '-v' '-w' '/tmp/graph15081892718299673984.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:24:27] [INFO ] Decomposing Gal with order
[2022-05-20 14:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:24:27] [INFO ] Removed a total of 634 redundant transitions.
[2022-05-20 14:24:27] [INFO ] Flatten gal took : 103 ms
[2022-05-20 14:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 630 labels/synchronizations in 20 ms.
[2022-05-20 14:24:27] [INFO ] Time to serialize gal into /tmp/LTL13638169540785731355.gal : 9 ms
[2022-05-20 14:24:27] [INFO ] Time to serialize properties into /tmp/LTL8625737838924118782.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13638169540785731355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8625737838924118782.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1363816...246
Read 1 LTL properties
Checking formula 0 : !((G(X(F(X(G(F("((i4.i0.u40.p411==0)||(i5.i0.u53.p539==1))"))))))))
Formula 0 simplified : !GXFXGF"((i4.i0.u40.p411==0)||(i5.i0.u53.p539==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1117257041489524377
[2022-05-20 14:24:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1117257041489524377
Running compilation step : cd /tmp/ltsmin1117257041489524377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 917 ms.
Running link step : cd /tmp/ltsmin1117257041489524377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1117257041489524377;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLCardinality-04 finished in 81573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 993 transition count 1143
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 993 transition count 1143
Applied a total of 26 rules in 55 ms. Remains 993 /1006 variables (removed 13) and now considering 1143/1156 (removed 13) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:24:57] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:24:58] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:24:58] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:24:59] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:24:59] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:24:59] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1006 places, 1143/1156 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/1006 places, 1143/1156 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-06 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 (EQ s45 0) (EQ s704 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 778 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLCardinality-06 finished in 1700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(X(G(p0)))))))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1005 transition count 1035
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 885 transition count 1035
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 885 transition count 886
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 736 transition count 886
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 552 place count 722 transition count 872
Iterating global reduction 2 with 14 rules applied. Total rules applied 566 place count 722 transition count 872
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 566 place count 722 transition count 864
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 582 place count 714 transition count 864
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 289
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 2 with 578 rules applied. Total rules applied 1160 place count 425 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1162 place count 423 transition count 573
Applied a total of 1162 rules in 101 ms. Remains 423 /1006 variables (removed 583) and now considering 573/1156 (removed 583) transitions.
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:24:59] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:24:59] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 573 rows 423 cols
[2022-05-20 14:24:59] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:00] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2022-05-20 14:25:00] [INFO ] Redundant transitions in 95 ms returned [572]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:25:00] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:00] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/1006 places, 572/1156 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 423/1006 places, 572/1156 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-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:(AND (EQ s69 0) (EQ s255 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 430 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLCardinality-07 finished in 1063 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||F(p1))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1005 transition count 1036
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 886 transition count 1036
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 238 place count 886 transition count 885
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 540 place count 735 transition count 885
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 554 place count 721 transition count 871
Iterating global reduction 2 with 14 rules applied. Total rules applied 568 place count 721 transition count 871
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 568 place count 721 transition count 864
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 582 place count 714 transition count 864
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: 288
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1158 place count 426 transition count 576
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1159 place count 425 transition count 575
Applied a total of 1159 rules in 94 ms. Remains 425 /1006 variables (removed 581) and now considering 575/1156 (removed 581) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:25:00] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:25:00] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:25:00] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:01] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2022-05-20 14:25:01] [INFO ] Redundant transitions in 99 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:01] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:25:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1006 places, 574/1156 transitions.
Applied a total of 0 rules in 10 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/1006 places, 574/1156 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s420 1), p1:(AND (EQ s30 0) (EQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 506 reset in 380 ms.
Product exploration explored 100000 steps with 504 reset in 429 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:03] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:03] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:03] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:03] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2022-05-20 14:25:03] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:03] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:25:03] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 392 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 558 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 505 reset in 373 ms.
Product exploration explored 100000 steps with 535 reset in 433 ms.
Built C files in :
/tmp/ltsmin3994764033971969627
[2022-05-20 14:25:05] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:25:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:05] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:25:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:05] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:25:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:05] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3994764033971969627
Running compilation step : cd /tmp/ltsmin3994764033971969627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1309 ms.
Running link step : cd /tmp/ltsmin3994764033971969627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3994764033971969627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10934478296781543698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 18 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:21] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:25:21] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:21] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:21] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2022-05-20 14:25:21] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:25:21] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:25:21] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Built C files in :
/tmp/ltsmin6786641169026122237
[2022-05-20 14:25:21] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:25:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:21] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:25:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:21] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:25:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:25:21] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6786641169026122237
Running compilation step : cd /tmp/ltsmin6786641169026122237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1344 ms.
Running link step : cd /tmp/ltsmin6786641169026122237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6786641169026122237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8366508655530842795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:25:37] [INFO ] Flatten gal took : 32 ms
[2022-05-20 14:25:37] [INFO ] Flatten gal took : 25 ms
[2022-05-20 14:25:37] [INFO ] Time to serialize gal into /tmp/LTL15520935633079047847.gal : 5 ms
[2022-05-20 14:25:37] [INFO ] Time to serialize properties into /tmp/LTL10269734148231101966.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15520935633079047847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10269734148231101966.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1552093...268
Read 1 LTL properties
Checking formula 0 : !((G((F("(p1192!=1)"))||(F("((p108==0)&&(p615==1))")))))
Formula 0 simplified : !G(F"(p1192!=1)" | F"((p108==0)&&(p615==1))")
Detected timeout of ITS tools.
[2022-05-20 14:25:52] [INFO ] Flatten gal took : 23 ms
[2022-05-20 14:25:52] [INFO ] Applying decomposition
[2022-05-20 14:25:52] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16547514135270315531.txt' '-o' '/tmp/graph16547514135270315531.bin' '-w' '/tmp/graph16547514135270315531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16547514135270315531.bin' '-l' '-1' '-v' '-w' '/tmp/graph16547514135270315531.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:25:52] [INFO ] Decomposing Gal with order
[2022-05-20 14:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:25:52] [INFO ] Removed a total of 634 redundant transitions.
[2022-05-20 14:25:52] [INFO ] Flatten gal took : 39 ms
[2022-05-20 14:25:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 652 labels/synchronizations in 8 ms.
[2022-05-20 14:25:52] [INFO ] Time to serialize gal into /tmp/LTL6680559268353448720.gal : 4 ms
[2022-05-20 14:25:52] [INFO ] Time to serialize properties into /tmp/LTL11928319353471358575.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6680559268353448720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11928319353471358575.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6680559...246
Read 1 LTL properties
Checking formula 0 : !((G((F("(i12.i1.u122.p1192!=1)"))||(F("((i0.i1.u8.p108==0)&&(i5.i1.u62.p615==1))")))))
Formula 0 simplified : !G(F"(i12.i1.u122.p1192!=1)" | F"((i0.i1.u8.p108==0)&&(i5.i1.u62.p615==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1979400878827749981
[2022-05-20 14:26:07] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1979400878827749981
Running compilation step : cd /tmp/ltsmin1979400878827749981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 937 ms.
Running link step : cd /tmp/ltsmin1979400878827749981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1979400878827749981;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLCardinality-11 finished in 81808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(F(X(p0)))))||!p0)))'
Support contains 1 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1005 transition count 1034
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 884 transition count 1034
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 884 transition count 884
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 734 transition count 884
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 556 place count 720 transition count 870
Iterating global reduction 2 with 14 rules applied. Total rules applied 570 place count 720 transition count 870
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 570 place count 720 transition count 862
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 586 place count 712 transition count 862
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 289
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 2 with 578 rules applied. Total rules applied 1164 place count 423 transition count 573
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1166 place count 421 transition count 571
Applied a total of 1166 rules in 77 ms. Remains 421 /1006 variables (removed 585) and now considering 571/1156 (removed 585) transitions.
// Phase 1: matrix 571 rows 421 cols
[2022-05-20 14:26:22] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:26:22] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 571 rows 421 cols
[2022-05-20 14:26:22] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:26:23] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2022-05-20 14:26:23] [INFO ] Redundant transitions in 99 ms returned [570]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:23] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:26:23] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/1006 places, 570/1156 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 421/1006 places, 570/1156 transitions.
Stuttering acceptance computed with spot in 420 ms :[false, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 254 reset in 363 ms.
Product exploration explored 100000 steps with 255 reset in 420 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1173 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=146 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 570/570 transitions.
Applied a total of 0 rules in 14 ms. Remains 421 /421 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:25] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 14:26:25] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:25] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:26:25] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2022-05-20 14:26:25] [INFO ] Redundant transitions in 89 ms returned []
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:25] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 570/570 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 361 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=90 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 254 reset in 372 ms.
Product exploration explored 100000 steps with 253 reset in 427 ms.
Built C files in :
/tmp/ltsmin15544023301405224376
[2022-05-20 14:26:27] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2022-05-20 14:26:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:27] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2022-05-20 14:26:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:27] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2022-05-20 14:26:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:27] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15544023301405224376
Running compilation step : cd /tmp/ltsmin15544023301405224376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1329 ms.
Running link step : cd /tmp/ltsmin15544023301405224376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15544023301405224376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15043152192630201030.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 570/570 transitions.
Applied a total of 0 rules in 13 ms. Remains 421 /421 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:42] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 14:26:42] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:42] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 14:26:43] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2022-05-20 14:26:43] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 570 rows 421 cols
[2022-05-20 14:26:43] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:26:43] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 570/570 transitions.
Built C files in :
/tmp/ltsmin3267812037450599094
[2022-05-20 14:26:43] [INFO ] Computing symmetric may disable matrix : 570 transitions.
[2022-05-20 14:26:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:43] [INFO ] Computing symmetric may enable matrix : 570 transitions.
[2022-05-20 14:26:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:43] [INFO ] Computing Do-Not-Accords matrix : 570 transitions.
[2022-05-20 14:26:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:26:43] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3267812037450599094
Running compilation step : cd /tmp/ltsmin3267812037450599094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1467 ms.
Running link step : cd /tmp/ltsmin3267812037450599094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3267812037450599094;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5844756200461057648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:26:58] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:26:58] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:26:58] [INFO ] Time to serialize gal into /tmp/LTL6975543278324403674.gal : 3 ms
[2022-05-20 14:26:58] [INFO ] Time to serialize properties into /tmp/LTL2153140399405412541.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6975543278324403674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2153140399405412541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6975543...266
Read 1 LTL properties
Checking formula 0 : !((G((X(X(G(F(X("(p43!=1)"))))))||("(p43==1)"))))
Formula 0 simplified : !G("(p43==1)" | XXGFX"(p43!=1)")
Detected timeout of ITS tools.
[2022-05-20 14:27:13] [INFO ] Flatten gal took : 20 ms
[2022-05-20 14:27:13] [INFO ] Applying decomposition
[2022-05-20 14:27:13] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14066104979029169155.txt' '-o' '/tmp/graph14066104979029169155.bin' '-w' '/tmp/graph14066104979029169155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14066104979029169155.bin' '-l' '-1' '-v' '-w' '/tmp/graph14066104979029169155.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:27:13] [INFO ] Decomposing Gal with order
[2022-05-20 14:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:27:13] [INFO ] Removed a total of 625 redundant transitions.
[2022-05-20 14:27:13] [INFO ] Flatten gal took : 38 ms
[2022-05-20 14:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 644 labels/synchronizations in 8 ms.
[2022-05-20 14:27:13] [INFO ] Time to serialize gal into /tmp/LTL4753296299582602039.gal : 3 ms
[2022-05-20 14:27:13] [INFO ] Time to serialize properties into /tmp/LTL9486151523633030825.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4753296299582602039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9486151523633030825.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4753296...245
Read 1 LTL properties
Checking formula 0 : !((G((X(X(G(F(X("(i0.i0.u1.p43!=1)"))))))||("(i0.i0.u1.p43==1)"))))
Formula 0 simplified : !G("(i0.i0.u1.p43==1)" | XXGFX"(i0.i0.u1.p43!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14264832262029819019
[2022-05-20 14:27:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14264832262029819019
Running compilation step : cd /tmp/ltsmin14264832262029819019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 899 ms.
Running link step : cd /tmp/ltsmin14264832262029819019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14264832262029819019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X([](<>(X((LTLAPp0==true))))))||!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLCardinality-12 finished in 81585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1006 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 993 transition count 1143
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 993 transition count 1143
Applied a total of 26 rules in 43 ms. Remains 993 /1006 variables (removed 13) and now considering 1143/1156 (removed 13) transitions.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:27:44] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 14:27:44] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:27:44] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:27:45] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
// Phase 1: matrix 1143 rows 993 cols
[2022-05-20 14:27:45] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 14:27:45] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 993/1006 places, 1143/1156 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/1006 places, 1143/1156 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s505 0) (EQ s685 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 0 ms.
FORMULA ShieldRVs-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-030B-LTLCardinality-13 finished in 1794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(!p2)||p1))&&F(p0))))'
Support contains 3 out of 1006 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1006/1006 places, 1156/1156 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1005 transition count 1035
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 885 transition count 1035
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 240 place count 885 transition count 886
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 538 place count 736 transition count 886
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 551 place count 723 transition count 873
Iterating global reduction 2 with 13 rules applied. Total rules applied 564 place count 723 transition count 873
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 564 place count 723 transition count 865
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 580 place count 715 transition count 865
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: 288
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1156 place count 427 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1158 place count 425 transition count 575
Applied a total of 1158 rules in 83 ms. Remains 425 /1006 variables (removed 581) and now considering 575/1156 (removed 581) transitions.
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:27:45] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 14:27:46] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 575 rows 425 cols
[2022-05-20 14:27:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:27:46] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2022-05-20 14:27:46] [INFO ] Redundant transitions in 97 ms returned [574]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:27:46] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1006 places, 574/1156 transitions.
Applied a total of 0 rules in 9 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 425/1006 places, 574/1156 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldRVs-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s320 0) (EQ s62 1)), p2:(OR (EQ s320 0) (EQ s62 1)), p0:(EQ s102 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 26944 reset in 331 ms.
Product exploration explored 100000 steps with 27070 reset in 377 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X p0), (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))))]
Knowledge based reduction with 13 factoid took 633 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X p0), (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F p0)]
Knowledge based reduction with 13 factoid took 845 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:49] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:27:49] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:27:50] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-05-20 14:27:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:27:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:27:50] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2022-05-20 14:27:50] [INFO ] Computed and/alt/rep : 508/2169/508 causal constraints (skipped 64 transitions) in 45 ms.
[2022-05-20 14:27:56] [INFO ] Added : 502 causal constraints over 102 iterations in 6239 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 425 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 425 /425 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:56] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:27:57] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:57] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:27:57] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2022-05-20 14:27:57] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:57] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:27:57] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 425/425 places, 574/574 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/425 stabilizing places and 2/574 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 574 rows 425 cols
[2022-05-20 14:27:58] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:27:58] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2022-05-20 14:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 14:27:58] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2022-05-20 14:27:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 14:27:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2022-05-20 14:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 14:27:59] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-05-20 14:27:59] [INFO ] Computed and/alt/rep : 508/2169/508 causal constraints (skipped 64 transitions) in 28 ms.
[2022-05-20 14:28:05] [INFO ] Added : 502 causal constraints over 102 iterations in 6471 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27130 reset in 320 ms.
Product exploration explored 100000 steps with 26787 reset in 358 ms.
Built C files in :
/tmp/ltsmin14778650350295046087
[2022-05-20 14:28:06] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2022-05-20 14:28:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:06] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2022-05-20 14:28:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:06] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2022-05-20 14:28:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:06] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14778650350295046087
Running compilation step : cd /tmp/ltsmin14778650350295046087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1304 ms.
Running link step : cd /tmp/ltsmin14778650350295046087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14778650350295046087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16396805541791543681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 425/425 places, 574/574 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 423 transition count 572
Applied a total of 4 rules in 18 ms. Remains 423 /425 variables (removed 2) and now considering 572/574 (removed 2) transitions.
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:28:21] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 14:28:21] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:28:21] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:28:22] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2022-05-20 14:28:22] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 572 rows 423 cols
[2022-05-20 14:28:22] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 14:28:22] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 423/425 places, 572/574 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/425 places, 572/574 transitions.
Built C files in :
/tmp/ltsmin124999409489839744
[2022-05-20 14:28:22] [INFO ] Computing symmetric may disable matrix : 572 transitions.
[2022-05-20 14:28:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:22] [INFO ] Computing symmetric may enable matrix : 572 transitions.
[2022-05-20 14:28:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:22] [INFO ] Computing Do-Not-Accords matrix : 572 transitions.
[2022-05-20 14:28:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:28:22] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin124999409489839744
Running compilation step : cd /tmp/ltsmin124999409489839744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1277 ms.
Running link step : cd /tmp/ltsmin124999409489839744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin124999409489839744;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1373176661198884841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 14:28:37] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:28:37] [INFO ] Flatten gal took : 18 ms
[2022-05-20 14:28:37] [INFO ] Time to serialize gal into /tmp/LTL6481322228559246159.gal : 3 ms
[2022-05-20 14:28:37] [INFO ] Time to serialize properties into /tmp/LTL4497080758115283116.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6481322228559246159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4497080758115283116.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6481322...266
Read 1 LTL properties
Checking formula 0 : !((F((("(p307==1)")U(((G(!("((p911==0)||(p204==1))")))||("(p911==0)"))||("(p204==1)")))&&(F("(p307==1)")))))
Formula 0 simplified : !F(("(p307==1)" U ("(p204==1)" | "(p911==0)" | G!"((p911==0)||(p204==1))")) & F"(p307==1)")
Detected timeout of ITS tools.
[2022-05-20 14:28:52] [INFO ] Flatten gal took : 19 ms
[2022-05-20 14:28:52] [INFO ] Applying decomposition
[2022-05-20 14:28:52] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17343398768277991125.txt' '-o' '/tmp/graph17343398768277991125.bin' '-w' '/tmp/graph17343398768277991125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17343398768277991125.bin' '-l' '-1' '-v' '-w' '/tmp/graph17343398768277991125.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:28:52] [INFO ] Decomposing Gal with order
[2022-05-20 14:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:28:52] [INFO ] Removed a total of 625 redundant transitions.
[2022-05-20 14:28:53] [INFO ] Flatten gal took : 34 ms
[2022-05-20 14:28:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 660 labels/synchronizations in 8 ms.
[2022-05-20 14:28:53] [INFO ] Time to serialize gal into /tmp/LTL16678087637174139014.gal : 3 ms
[2022-05-20 14:28:53] [INFO ] Time to serialize properties into /tmp/LTL15301686785288532304.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16678087637174139014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15301686785288532304.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1667808...247
Read 1 LTL properties
Checking formula 0 : !((F((("(i3.i1.u29.p307==1)")U(((G(!("((i10.i0.u92.p911==0)||(i2.i0.u18.p204==1))")))||("(i10.i0.u92.p911==0)"))||("(i2.i0.u18.p204==1...191
Formula 0 simplified : !F(("(i3.i1.u29.p307==1)" U ("(i2.i0.u18.p204==1)" | "(i10.i0.u92.p911==0)" | G!"((i10.i0.u92.p911==0)||(i2.i0.u18.p204==1))")) & F"...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15154631374749385816
[2022-05-20 14:29:08] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15154631374749385816
Running compilation step : cd /tmp/ltsmin15154631374749385816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 916 ms.
Running link step : cd /tmp/ltsmin15154631374749385816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15154631374749385816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true) U ([](!(LTLAPp2==true))||(LTLAPp1==true)))&&<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-030B-LTLCardinality-14 finished in 97332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(G(F(p0)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||F(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(F(X(p0)))))||!p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(!p2)||p1))&&F(p0))))'
[2022-05-20 14:29:23] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8401282577525605721
[2022-05-20 14:29:23] [INFO ] Computing symmetric may disable matrix : 1156 transitions.
[2022-05-20 14:29:23] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:29:23] [INFO ] Computing symmetric may enable matrix : 1156 transitions.
[2022-05-20 14:29:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:29:23] [INFO ] Applying decomposition
[2022-05-20 14:29:23] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16596227010443352231.txt' '-o' '/tmp/graph16596227010443352231.bin' '-w' '/tmp/graph16596227010443352231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16596227010443352231.bin' '-l' '-1' '-v' '-w' '/tmp/graph16596227010443352231.weights' '-q' '0' '-e' '0.001'
[2022-05-20 14:29:23] [INFO ] Decomposing Gal with order
[2022-05-20 14:29:23] [INFO ] Computing Do-Not-Accords matrix : 1156 transitions.
[2022-05-20 14:29:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:29:23] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 14:29:23] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8401282577525605721
Running compilation step : cd /tmp/ltsmin8401282577525605721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 14:29:23] [INFO ] Removed a total of 1071 redundant transitions.
[2022-05-20 14:29:23] [INFO ] Flatten gal took : 60 ms
[2022-05-20 14:29:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 14:29:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality12909654792246534161.gal : 150 ms
[2022-05-20 14:29:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality11264946402445224747.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12909654792246534161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11264946402445224747.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 4 LTL properties
Checking formula 0 : !((G(X(F(X(G(F("((i5.u127.p411==0)||(i7.u166.p539==1))"))))))))
Formula 0 simplified : !GXFXGF"((i5.u127.p411==0)||(i7.u166.p539==1))"
Compilation finished in 3490 ms.
Running link step : cd /tmp/ltsmin8401282577525605721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8401282577525605721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.093: LTL layer: formula: [](X(<>(X([](<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.093: "[](X(<>(X([](<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.096: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.138: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.311: DFS-FIFO for weak LTL, using special progress label 1164
pins2lts-mc-linux64( 0/ 8), 0.311: There are 1165 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.311: State length is 1007, there are 1159 groups
pins2lts-mc-linux64( 0/ 8), 0.311: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.311: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.311: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.311: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.388: ~1 levels ~960 states ~5048 transitions
pins2lts-mc-linux64( 5/ 8), 0.475: ~1 levels ~1920 states ~10928 transitions
pins2lts-mc-linux64( 1/ 8), 0.634: ~1 levels ~3840 states ~23984 transitions
pins2lts-mc-linux64( 1/ 8), 0.939: ~1 levels ~7680 states ~50976 transitions
pins2lts-mc-linux64( 1/ 8), 1.537: ~1 levels ~15360 states ~113720 transitions
pins2lts-mc-linux64( 5/ 8), 4.941: ~1 levels ~30720 states ~245752 transitions
pins2lts-mc-linux64( 3/ 8), 12.441: ~1 levels ~61440 states ~526696 transitions
pins2lts-mc-linux64( 5/ 8), 26.667: ~1 levels ~122880 states ~1118232 transitions
pins2lts-mc-linux64( 6/ 8), 54.808: ~1 levels ~245760 states ~2481688 transitions
pins2lts-mc-linux64( 2/ 8), 94.820: ~1 levels ~491520 states ~5182296 transitions
pins2lts-mc-linux64( 0/ 8), 125.508: ~1 levels ~983040 states ~10283448 transitions
pins2lts-mc-linux64( 2/ 8), 187.841: ~1 levels ~1966080 states ~22515440 transitions
pins2lts-mc-linux64( 5/ 8), 317.991: ~1 levels ~3932160 states ~45571712 transitions
pins2lts-mc-linux64( 3/ 8), 572.993: ~1 levels ~7864320 states ~93996144 transitions
pins2lts-mc-linux64( 4/ 8), 602.937: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 603.026:
pins2lts-mc-linux64( 0/ 8), 603.026: mean standard work distribution: 2.4% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 603.026:
pins2lts-mc-linux64( 0/ 8), 603.026: Explored 8079903 states 98945952 transitions, fanout: 12.246
pins2lts-mc-linux64( 0/ 8), 603.026: Total exploration time 602.690 sec (602.620 sec minimum, 602.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 603.026: States per second: 13406, Transitions per second: 164174
pins2lts-mc-linux64( 0/ 8), 603.026:
pins2lts-mc-linux64( 0/ 8), 603.026: Progress states detected: 19092039
pins2lts-mc-linux64( 0/ 8), 603.026: Redundant explorations: -57.6793
pins2lts-mc-linux64( 0/ 8), 603.026:
pins2lts-mc-linux64( 0/ 8), 603.026: Queue width: 8B, total height: 18175864, memory: 138.67MB
pins2lts-mc-linux64( 0/ 8), 603.026: Tree memory: 401.7MB, 22.1 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 603.026: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 603.026: Stored 1467 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 603.026: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 603.026: Est. total memory use: 540.3MB (~1162.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8401282577525605721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8401282577525605721;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 14:51:58] [INFO ] Applying decomposition
[2022-05-20 14:51:58] [INFO ] Flatten gal took : 326 ms
[2022-05-20 14:51:59] [INFO ] Decomposing Gal with order
[2022-05-20 14:51:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 14:52:00] [INFO ] Removed a total of 627 redundant transitions.
[2022-05-20 14:52:00] [INFO ] Flatten gal took : 301 ms
[2022-05-20 14:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 952 labels/synchronizations in 35 ms.
[2022-05-20 14:52:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality2824614121456655130.gal : 30 ms
[2022-05-20 14:52:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality7341372953079853692.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2824614121456655130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7341372953079853692.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 4 LTL properties
Checking formula 0 : !((G(X(F(X(G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u99.p411==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...197
Formula 0 simplified : !GXFXGF"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u99.p411==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...183
Detected timeout of ITS tools.
[2022-05-20 15:14:20] [INFO ] Flatten gal took : 75 ms
[2022-05-20 15:14:20] [INFO ] Input system was already deterministic with 1156 transitions.
[2022-05-20 15:14:20] [INFO ] Transformed 1006 places.
[2022-05-20 15:14:20] [INFO ] Transformed 1156 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 15:14:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality8684389355327692039.gal : 5 ms
[2022-05-20 15:14:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality670971335149812055.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8684389355327692039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality670971335149812055.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025800827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;