Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 268K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716987644322

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 13:00:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:00:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:00:46] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-29 13:00:46] [INFO ] Transformed 1003 places.
[2024-05-29 13:00:46] [INFO ] Transformed 723 transitions.
[2024-05-29 13:00:46] [INFO ] Found NUPN structural information;
[2024-05-29 13:00:46] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 102 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:00:46] [INFO ] Computed 441 invariants in 25 ms
[2024-05-29 13:00:47] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-05-29 13:00:47] [INFO ] Invariant cache hit.
[2024-05-29 13:00:48] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2024-05-29 13:00:48] [INFO ] Invariant cache hit.
[2024-05-29 13:00:49] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2585 ms. Remains : 1003/1003 places, 722/722 transitions.
Support contains 17 out of 1003 places after structural reductions.
[2024-05-29 13:00:49] [INFO ] Flatten gal took : 136 ms
[2024-05-29 13:00:49] [INFO ] Flatten gal took : 66 ms
[2024-05-29 13:00:49] [INFO ] Input system was already deterministic with 722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 13:00:50] [INFO ] Invariant cache hit.
[2024-05-29 13:00:51] [INFO ] [Real]Absence check using 441 positive place invariants in 81 ms returned sat
[2024-05-29 13:00:51] [INFO ] After 399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-29 13:00:51] [INFO ] After 525ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:00:51] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:00:52] [INFO ] [Nat]Absence check using 441 positive place invariants in 68 ms returned sat
[2024-05-29 13:00:52] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:00:53] [INFO ] After 1267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 509 ms.
[2024-05-29 13:00:54] [INFO ] After 2209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 4 properties in 311 ms.
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 156 times.
Drop transitions removed 156 transitions
Iterating global reduction 0 with 156 rules applied. Total rules applied 160 place count 1001 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 161 place count 1000 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 162 place count 999 transition count 719
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 162 place count 999 transition count 717
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 166 place count 997 transition count 717
Applied a total of 166 rules in 340 ms. Remains 997 /1003 variables (removed 6) and now considering 717/722 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 997/1003 places, 717/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 182392 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182392 steps, saw 173789 distinct states, run finished after 3004 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 717 rows 997 cols
[2024-05-29 13:00:58] [INFO ] Computed 440 invariants in 13 ms
[2024-05-29 13:00:58] [INFO ] [Real]Absence check using 440 positive place invariants in 106 ms returned sat
[2024-05-29 13:00:58] [INFO ] After 419ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 13:00:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-29 13:00:58] [INFO ] After 47ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:00:58] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:00:59] [INFO ] [Nat]Absence check using 440 positive place invariants in 77 ms returned sat
[2024-05-29 13:00:59] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:00:59] [INFO ] After 76ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 13:00:59] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-29 13:00:59] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 717/717 transitions.
Applied a total of 0 rules in 29 ms. Remains 997 /997 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 997/997 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 717/717 transitions.
Applied a total of 0 rules in 26 ms. Remains 997 /997 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-29 13:00:59] [INFO ] Invariant cache hit.
[2024-05-29 13:01:00] [INFO ] Implicit Places using invariants in 627 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 630 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 995/997 places, 717/717 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 993 transition count 715
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 993 transition count 715
Applied a total of 4 rules in 75 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2024-05-29 13:01:00] [INFO ] Computed 438 invariants in 7 ms
[2024-05-29 13:01:01] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-29 13:01:01] [INFO ] Invariant cache hit.
[2024-05-29 13:01:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-29 13:01:02] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 993/997 places, 715/717 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2956 ms. Remains : 993/997 places, 715/717 transitions.
Finished random walk after 9401 steps, including 2 resets, run visited all 2 properties in 160 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((F(G(p0))&&p1)))||(F(X(X(p2))) U p1))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:01:03] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 13:01:03] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-29 13:01:03] [INFO ] Invariant cache hit.
[2024-05-29 13:01:05] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
[2024-05-29 13:01:05] [INFO ] Invariant cache hit.
[2024-05-29 13:01:05] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2410 ms. Remains : 1003/1003 places, 722/722 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 445 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s389 0) (EQ s465 1)), p2:(EQ s755 1), p0:(OR (EQ s646 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 748 ms.
Product exploration explored 100000 steps with 0 reset in 905 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-29 13:01:08] [INFO ] Invariant cache hit.
[2024-05-29 13:01:08] [INFO ] [Real]Absence check using 441 positive place invariants in 75 ms returned sat
[2024-05-29 13:01:09] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:01:09] [INFO ] [Nat]Absence check using 441 positive place invariants in 78 ms returned sat
[2024-05-29 13:01:10] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:01:10] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-29 13:01:10] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 126 ms.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 156 times.
Drop transitions removed 156 transitions
Iterating global reduction 0 with 156 rules applied. Total rules applied 160 place count 1001 transition count 720
Applied a total of 160 rules in 107 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Finished probabilistic random walk after 98514 steps, run visited all 2 properties in 1932 ms. (steps per millisecond=50 )
Probabilistic random walk after 98514 steps, saw 94420 distinct states, run finished after 1933 ms. (steps per millisecond=50 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0))), (F p2), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:01:14] [INFO ] Invariant cache hit.
[2024-05-29 13:01:14] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-29 13:01:14] [INFO ] Invariant cache hit.
[2024-05-29 13:01:15] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2024-05-29 13:01:15] [INFO ] Invariant cache hit.
[2024-05-29 13:01:16] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 1003/1003 places, 722/722 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1307 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 13:01:18] [INFO ] Invariant cache hit.
[2024-05-29 13:01:18] [INFO ] [Real]Absence check using 441 positive place invariants in 75 ms returned sat
[2024-05-29 13:01:19] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:01:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 73 ms returned sat
[2024-05-29 13:01:20] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 13:01:20] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-29 13:01:20] [INFO ] After 1207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 119 ms.
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 156 times.
Drop transitions removed 156 transitions
Iterating global reduction 0 with 156 rules applied. Total rules applied 160 place count 1001 transition count 720
Applied a total of 160 rules in 77 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Finished probabilistic random walk after 98514 steps, run visited all 2 properties in 1569 ms. (steps per millisecond=62 )
Probabilistic random walk after 98514 steps, saw 94420 distinct states, run finished after 1571 ms. (steps per millisecond=62 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p0))), (F p2), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 422 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 686 ms.
Product exploration explored 100000 steps with 0 reset in 875 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 722
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 152 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:01:26] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:01:26] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 13:01:26] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 722/722 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1032 ms. Remains : 1003/1003 places, 722/722 transitions.
Built C files in :
/tmp/ltsmin5748121135792830588
[2024-05-29 13:01:28] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5748121135792830588
Running compilation step : cd /tmp/ltsmin5748121135792830588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1447 ms.
Running link step : cd /tmp/ltsmin5748121135792830588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5748121135792830588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13214998518133540082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:01:44] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 13:01:44] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-29 13:01:44] [INFO ] Invariant cache hit.
[2024-05-29 13:01:46] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-05-29 13:01:46] [INFO ] Invariant cache hit.
[2024-05-29 13:01:46] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2674 ms. Remains : 1003/1003 places, 722/722 transitions.
Built C files in :
/tmp/ltsmin3947760589844770226
[2024-05-29 13:01:46] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3947760589844770226
Running compilation step : cd /tmp/ltsmin3947760589844770226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1335 ms.
Running link step : cd /tmp/ltsmin3947760589844770226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3947760589844770226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2749070923602608108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:02:01] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:02:01] [INFO ] Flatten gal took : 56 ms
[2024-05-29 13:02:02] [INFO ] Time to serialize gal into /tmp/LTL1444741629391966725.gal : 13 ms
[2024-05-29 13:02:02] [INFO ] Time to serialize properties into /tmp/LTL4682492715946063682.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1444741629391966725.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15784003526576578019.hoa' '-atoms' '/tmp/LTL4682492715946063682.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4682492715946063682.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15784003526576578019.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:02:17] [INFO ] Flatten gal took : 43 ms
[2024-05-29 13:02:17] [INFO ] Flatten gal took : 47 ms
[2024-05-29 13:02:17] [INFO ] Time to serialize gal into /tmp/LTL13624265355467373078.gal : 4 ms
[2024-05-29 13:02:17] [INFO ] Time to serialize properties into /tmp/LTL8142810576596459780.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13624265355467373078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8142810576596459780.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(X((F(G("((p646==0)||(p82==1))")))&&("((p389==0)||(p465==1))"))))||((F(X(X("(p755==1)"))))U("((p389==0)||(p465==1))")))))
Formula 0 simplified : F(!"((p389==0)||(p465==1))" & X(X(!"((p389==0)||(p465==1))" | GF!"((p646==0)||(p82==1))") & (!"((p389==0)||(p465==1))" W XG!"(p755==...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 13:02:32] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:02:32] [INFO ] Applying decomposition
[2024-05-29 13:02:32] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3318618110487942515.txt' '-o' '/tmp/graph3318618110487942515.bin' '-w' '/tmp/graph3318618110487942515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3318618110487942515.bin' '-l' '-1' '-v' '-w' '/tmp/graph3318618110487942515.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:02:32] [INFO ] Decomposing Gal with order
[2024-05-29 13:02:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:02:32] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 13:02:32] [INFO ] Flatten gal took : 90 ms
[2024-05-29 13:02:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 85 ms.
[2024-05-29 13:02:32] [INFO ] Time to serialize gal into /tmp/LTL12955923462948150639.gal : 20 ms
[2024-05-29 13:02:32] [INFO ] Time to serialize properties into /tmp/LTL14578029557812143561.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12955923462948150639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14578029557812143561.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((X(X((F(G("((i14.i1.i0.u205.p646==0)||(i1.i2.i0.u26.p82==1))")))&&("((i8.i0.i0.u123.p389==0)||(i10.i0.i2.u148.p465==1))"))))||((F...250
Formula 0 simplified : F(!"((i8.i0.i0.u123.p389==0)||(i10.i0.i2.u148.p465==1))" & X(X(!"((i8.i0.i0.u123.p389==0)||(i10.i0.i2.u148.p465==1))" | GF!"((i14.i1...291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9316883540293063232
[2024-05-29 13:02:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9316883540293063232
Running compilation step : cd /tmp/ltsmin9316883540293063232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2195 ms.
Running link step : cd /tmp/ltsmin9316883540293063232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9316883540293063232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-03 finished in 119748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:03:03] [INFO ] Invariant cache hit.
[2024-05-29 13:03:03] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-29 13:03:03] [INFO ] Invariant cache hit.
[2024-05-29 13:03:04] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2024-05-29 13:03:04] [INFO ] Invariant cache hit.
[2024-05-29 13:03:05] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2446 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s637 0) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2449 ms.
Product exploration explored 100000 steps with 50000 reset in 2472 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 29 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-06 finished in 7519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p1 U (!p2||(p3&&X((p3 U (!p4||G(p3)))))||G(!p1))))&&p0)))'
Support contains 8 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 20 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 13:03:10] [INFO ] Invariant cache hit.
[2024-05-29 13:03:11] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-29 13:03:11] [INFO ] Invariant cache hit.
[2024-05-29 13:03:12] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2024-05-29 13:03:12] [INFO ] Invariant cache hit.
[2024-05-29 13:03:13] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2484 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 3863 ms :[true, (OR (NOT p0) (AND p1 p2 (NOT p3))), (OR (NOT p0) (AND p1 p2 (NOT p3))), (AND p1 p2 (NOT p3)), (AND (NOT p3) p4), (AND p2 (NOT p3) p1 p4)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p3) p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3 p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) p4), acceptance={} source=4 dest: 0}, { cond=(AND p3 p4), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3) p1 p4), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1) p4), acceptance={} source=5 dest: 3}, { cond=(AND p2 p3 p1 p4), acceptance={} source=5 dest: 4}, { cond=(AND p2 p3 (NOT p1) p4), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (NEQ s861 0) (NEQ s189 1)), p2:(AND (OR (EQ s861 0) (EQ s189 1)) (NOT (OR (EQ s53 0) (EQ s96 1)))), p3:(OR (EQ s134 0) (EQ s916 1)), p1:(OR (EQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-08 finished in 6375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Applied a total of 4 rules in 49 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 13:03:16] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 13:03:17] [INFO ] Implicit Places using invariants in 649 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 650 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 36 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 13:03:17] [INFO ] Computed 440 invariants in 7 ms
[2024-05-29 13:03:18] [INFO ] Implicit Places using invariants in 625 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 629 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 48 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 13:03:18] [INFO ] Computed 438 invariants in 7 ms
[2024-05-29 13:03:18] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 13:03:18] [INFO ] Invariant cache hit.
[2024-05-29 13:03:20] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3235 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s571 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 1 reset in 667 ms.
Product exploration explored 100000 steps with 2 reset in 853 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:03:22] [INFO ] Invariant cache hit.
[2024-05-29 13:03:22] [INFO ] [Real]Absence check using 438 positive place invariants in 242 ms returned sat
[2024-05-29 13:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:03:23] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-29 13:03:23] [INFO ] Computed and/alt/rep : 715/2227/715 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-29 13:03:23] [INFO ] Added : 0 causal constraints over 0 iterations in 121 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 22 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:03:23] [INFO ] Invariant cache hit.
[2024-05-29 13:03:24] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-29 13:03:24] [INFO ] Invariant cache hit.
[2024-05-29 13:03:25] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2024-05-29 13:03:25] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 13:03:25] [INFO ] Invariant cache hit.
[2024-05-29 13:03:25] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2477 ms. Remains : 994/994 places, 716/716 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 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 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:03:26] [INFO ] Invariant cache hit.
[2024-05-29 13:03:27] [INFO ] [Real]Absence check using 438 positive place invariants in 219 ms returned sat
[2024-05-29 13:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:03:27] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-29 13:03:27] [INFO ] Computed and/alt/rep : 715/2227/715 causal constraints (skipped 0 transitions) in 46 ms.
[2024-05-29 13:03:27] [INFO ] Added : 0 causal constraints over 0 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 644 ms.
Product exploration explored 100000 steps with 2 reset in 926 ms.
Built C files in :
/tmp/ltsmin14931842939055492434
[2024-05-29 13:03:30] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:03:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:30] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:03:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:30] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:03:30] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:30] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14931842939055492434
Running compilation step : cd /tmp/ltsmin14931842939055492434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1952 ms.
Running link step : cd /tmp/ltsmin14931842939055492434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14931842939055492434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18404560341532495862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 23 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 13:03:45] [INFO ] Invariant cache hit.
[2024-05-29 13:03:46] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-29 13:03:46] [INFO ] Invariant cache hit.
[2024-05-29 13:03:47] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2024-05-29 13:03:47] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 13:03:47] [INFO ] Invariant cache hit.
[2024-05-29 13:03:48] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2484 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin12145574811858285041
[2024-05-29 13:03:48] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 13:03:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:48] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 13:03:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:48] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 13:03:48] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:03:48] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12145574811858285041
Running compilation step : cd /tmp/ltsmin12145574811858285041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1920 ms.
Running link step : cd /tmp/ltsmin12145574811858285041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12145574811858285041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18219480972478901020.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:04:03] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:04:03] [INFO ] Flatten gal took : 34 ms
[2024-05-29 13:04:03] [INFO ] Time to serialize gal into /tmp/LTL13809335566862789721.gal : 300 ms
[2024-05-29 13:04:10] [INFO ] Time to serialize properties into /tmp/LTL5380190082872636343.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13809335566862789721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12788152460613561156.hoa' '-atoms' '/tmp/LTL5380190082872636343.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5380190082872636343.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12788152460613561156.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1061 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.6864,233340,1,0,8,1.23723e+06,24,0,24251,560119,29
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-11 finished in 64860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 27 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 13:04:21] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 13:04:22] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-29 13:04:22] [INFO ] Invariant cache hit.
[2024-05-29 13:04:23] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2024-05-29 13:04:23] [INFO ] Invariant cache hit.
[2024-05-29 13:04:24] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2408 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s755 0) (EQ s660 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2461 ms.
Product exploration explored 100000 steps with 50000 reset in 2495 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-13 finished in 7503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((F(G(p0))&&p1)))||(F(X(X(p2))) U p1))))'
[2024-05-29 13:04:29] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10781807263488706242
[2024-05-29 13:04:29] [INFO ] Computing symmetric may disable matrix : 722 transitions.
[2024-05-29 13:04:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:04:29] [INFO ] Computing symmetric may enable matrix : 722 transitions.
[2024-05-29 13:04:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:04:29] [INFO ] Applying decomposition
[2024-05-29 13:04:29] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3178503035256607677.txt' '-o' '/tmp/graph3178503035256607677.bin' '-w' '/tmp/graph3178503035256607677.weights'
[2024-05-29 13:04:29] [INFO ] Computing Do-Not-Accords matrix : 722 transitions.
[2024-05-29 13:04:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:04:29] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781807263488706242
Running compilation step : cd /tmp/ltsmin10781807263488706242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3178503035256607677.bin' '-l' '-1' '-v' '-w' '/tmp/graph3178503035256607677.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:04:29] [INFO ] Decomposing Gal with order
[2024-05-29 13:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:04:29] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 13:04:29] [INFO ] Flatten gal took : 61 ms
[2024-05-29 13:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 25 ms.
[2024-05-29 13:04:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality17459386250225643654.gal : 22 ms
[2024-05-29 13:04:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality16571834842804539018.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17459386250225643654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16571834842804539018.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((X(X((F(G("((i13.u205.p646==0)||(i1.i1.i3.u26.p82==1))")))&&("((i8.i1.i2.u123.p389==0)||(i10.i2.i0.u148.p465==1))"))))||((F(X(X("...244
Formula 0 simplified : F(!"((i8.i1.i2.u123.p389==0)||(i10.i2.i0.u148.p465==1))" & X(X(!"((i8.i1.i2.u123.p389==0)||(i10.i2.i0.u148.p465==1))" | GF!"((i13.u2...285
Compilation finished in 8168 ms.
Running link step : cd /tmp/ltsmin10781807263488706242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin10781807263488706242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
4995 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,50.0854,736380,1,0,1.28955e+06,493,4967,3.93725e+06,129,2756,860050
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 339348 ms.

BK_STOP 1716987986721

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-040A, examination is 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 r373-tall-171683789200412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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