Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800643.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 20:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 201K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679218161282

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 09:29:27] [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]
[2023-03-19 09:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:29:27] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-19 09:29:27] [INFO ] Transformed 753 places.
[2023-03-19 09:29:27] [INFO ] Transformed 543 transitions.
[2023-03-19 09:29:27] [INFO ] Found NUPN structural information;
[2023-03-19 09:29:27] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 104 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:29:27] [INFO ] Computed 331 place invariants in 24 ms
[2023-03-19 09:29:28] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-19 09:29:28] [INFO ] Invariant cache hit.
[2023-03-19 09:29:29] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2023-03-19 09:29:29] [INFO ] Invariant cache hit.
[2023-03-19 09:29:30] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2640 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 36 out of 753 places after structural reductions.
[2023-03-19 09:29:30] [INFO ] Flatten gal took : 104 ms
[2023-03-19 09:29:30] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:29:30] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 30 out of 753 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 09:29:32] [INFO ] Invariant cache hit.
[2023-03-19 09:29:32] [INFO ] [Real]Absence check using 331 positive place invariants in 75 ms returned sat
[2023-03-19 09:29:33] [INFO ] After 1821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 09:29:34] [INFO ] [Nat]Absence check using 331 positive place invariants in 98 ms returned sat
[2023-03-19 09:29:36] [INFO ] After 1858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 09:29:37] [INFO ] After 3043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 792 ms.
[2023-03-19 09:29:38] [INFO ] After 4639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 7 properties in 490 ms.
Support contains 10 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 120 place count 751 transition count 540
Applied a total of 120 rules in 136 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:29:39] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-19 09:29:39] [INFO ] [Real]Absence check using 331 positive place invariants in 78 ms returned sat
[2023-03-19 09:29:40] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:29:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 57 ms returned sat
[2023-03-19 09:29:40] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:29:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 09:29:41] [INFO ] After 260ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:29:41] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-19 09:29:41] [INFO ] After 1411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 6 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 751 transition count 540
Applied a total of 1 rules in 76 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 751/751 places, 540/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254995 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{0=1}
Probabilistic random walk after 254995 steps, saw 245469 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:29:44] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-19 09:29:45] [INFO ] [Real]Absence check using 331 positive place invariants in 79 ms returned sat
[2023-03-19 09:29:45] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:29:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 55 ms returned sat
[2023-03-19 09:29:46] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:29:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-19 09:29:46] [INFO ] After 166ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:29:46] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-19 09:29:46] [INFO ] After 980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1018 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 24 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 19 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:29:47] [INFO ] Computed 331 place invariants in 7 ms
[2023-03-19 09:29:47] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-19 09:29:47] [INFO ] Invariant cache hit.
[2023-03-19 09:29:48] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-03-19 09:29:48] [INFO ] Invariant cache hit.
[2023-03-19 09:29:49] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2429 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s546 0), p1:(AND (EQ s546 0) (EQ s490 0) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 681 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-00 finished in 3618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 33 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-19 09:29:50] [INFO ] Invariant cache hit.
[2023-03-19 09:29:51] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-19 09:29:51] [INFO ] Invariant cache hit.
[2023-03-19 09:29:52] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-19 09:29:52] [INFO ] Invariant cache hit.
[2023-03-19 09:29:52] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2040 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s521 1), p1:(OR (EQ s381 0) (EQ s610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 641 ms.
Product exploration explored 100000 steps with 0 reset in 781 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:29:54] [INFO ] Invariant cache hit.
[2023-03-19 09:29:55] [INFO ] [Real]Absence check using 331 positive place invariants in 87 ms returned sat
[2023-03-19 09:29:55] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:29:55] [INFO ] After 341ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 09:29:55] [INFO ] After 625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Applied a total of 122 rules in 88 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 751/753 places, 540/542 transitions.
Finished random walk after 6391 steps, including 1 resets, run visited all 1 properties in 38 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 735 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-19 09:29:56] [INFO ] Invariant cache hit.
[2023-03-19 09:29:57] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-19 09:29:57] [INFO ] Invariant cache hit.
[2023-03-19 09:29:58] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2023-03-19 09:29:58] [INFO ] Invariant cache hit.
[2023-03-19 09:29:58] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1891 ms. Remains : 753/753 places, 542/542 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 501 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:29:59] [INFO ] Invariant cache hit.
[2023-03-19 09:29:59] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2023-03-19 09:30:00] [INFO ] After 344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 09:30:00] [INFO ] After 403ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 09:30:00] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Applied a total of 122 rules in 88 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36603 steps, run visited all 1 properties in 356 ms. (steps per millisecond=102 )
Probabilistic random walk after 36603 steps, saw 34274 distinct states, run finished after 356 ms. (steps per millisecond=102 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 1064 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 589 ms.
Product exploration explored 100000 steps with 0 reset in 734 ms.
Built C files in :
/tmp/ltsmin15064867761906843749
[2023-03-19 09:30:03] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15064867761906843749
Running compilation step : cd /tmp/ltsmin15064867761906843749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1121 ms.
Running link step : cd /tmp/ltsmin15064867761906843749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin15064867761906843749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12295933769131493401.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 10 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-19 09:30:18] [INFO ] Invariant cache hit.
[2023-03-19 09:30:19] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-19 09:30:19] [INFO ] Invariant cache hit.
[2023-03-19 09:30:20] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2023-03-19 09:30:20] [INFO ] Invariant cache hit.
[2023-03-19 09:30:20] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1943 ms. Remains : 753/753 places, 542/542 transitions.
Built C files in :
/tmp/ltsmin3922864012254626602
[2023-03-19 09:30:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3922864012254626602
Running compilation step : cd /tmp/ltsmin3922864012254626602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 915 ms.
Running link step : cd /tmp/ltsmin3922864012254626602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin3922864012254626602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6024828469450049665.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:30:36] [INFO ] Flatten gal took : 39 ms
[2023-03-19 09:30:36] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:30:36] [INFO ] Time to serialize gal into /tmp/LTL1842940304837133193.gal : 5 ms
[2023-03-19 09:30:36] [INFO ] Time to serialize properties into /tmp/LTL3874688123091898277.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1842940304837133193.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13973903668686694681.hoa' '-atoms' '/tmp/LTL3874688123091898277.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3874688123091898277.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13973903668686694681.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:30:51] [INFO ] Flatten gal took : 34 ms
[2023-03-19 09:30:51] [INFO ] Flatten gal took : 31 ms
[2023-03-19 09:30:51] [INFO ] Time to serialize gal into /tmp/LTL9885698712253857248.gal : 5 ms
[2023-03-19 09:30:51] [INFO ] Time to serialize properties into /tmp/LTL765113707419267258.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9885698712253857248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL765113707419267258.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("(p521==1)")||(X("((p381==0)||(p610==1))")))))
Formula 0 simplified : F(!"(p521==1)" & X!"((p381==0)||(p610==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:31:06] [INFO ] Flatten gal took : 81 ms
[2023-03-19 09:31:06] [INFO ] Applying decomposition
[2023-03-19 09:31:06] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6171808172966601097.txt' '-o' '/tmp/graph6171808172966601097.bin' '-w' '/tmp/graph6171808172966601097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6171808172966601097.bin' '-l' '-1' '-v' '-w' '/tmp/graph6171808172966601097.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:31:06] [INFO ] Decomposing Gal with order
[2023-03-19 09:31:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:31:06] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-19 09:31:06] [INFO ] Flatten gal took : 64 ms
[2023-03-19 09:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 39 ms.
[2023-03-19 09:31:06] [INFO ] Time to serialize gal into /tmp/LTL17570165149507451100.gal : 9 ms
[2023-03-19 09:31:06] [INFO ] Time to serialize properties into /tmp/LTL11075422980579859602.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17570165149507451100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11075422980579859602.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(i12.u165.p521==1)")||(X("((i9.u122.p381==0)||(i15.u195.p610==1))")))))
Formula 0 simplified : F(!"(i12.u165.p521==1)" & X!"((i9.u122.p381==0)||(i15.u195.p610==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4393928146585893838
[2023-03-19 09:31:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4393928146585893838
Running compilation step : cd /tmp/ltsmin4393928146585893838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 886 ms.
Running link step : cd /tmp/ltsmin4393928146585893838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin4393928146585893838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-01 finished in 106391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 750 transition count 540
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 750 transition count 538
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 7 place count 748 transition count 538
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 747 transition count 537
Applied a total of 9 rules in 90 ms. Remains 747 /753 variables (removed 6) and now considering 537/542 (removed 5) transitions.
// Phase 1: matrix 537 rows 747 cols
[2023-03-19 09:31:37] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:31:37] [INFO ] Implicit Places using invariants in 611 ms returned [730, 734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 745/753 places, 537/542 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 743 transition count 535
Applied a total of 4 rules in 28 ms. Remains 743 /745 variables (removed 2) and now considering 535/537 (removed 2) transitions.
// Phase 1: matrix 535 rows 743 cols
[2023-03-19 09:31:37] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:31:38] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-19 09:31:38] [INFO ] Invariant cache hit.
[2023-03-19 09:31:39] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 743/753 places, 535/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2165 ms. Remains : 743/753 places, 535/542 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s648 0) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Stack based approach found an accepted trace after 158 steps with 0 reset with depth 159 and stack size 159 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-02 finished in 2829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U ((p1 U (!p2||X(p1))) U G(p1))))'
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 23 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:31:39] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-19 09:31:40] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-19 09:31:40] [INFO ] Invariant cache hit.
[2023-03-19 09:31:41] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2023-03-19 09:31:41] [INFO ] Invariant cache hit.
[2023-03-19 09:31:41] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s706 1), p2:(OR (EQ s349 0) (EQ s697 1)), p0:(OR (EQ s72 0) (EQ s509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 592 ms.
Product exploration explored 100000 steps with 0 reset in 668 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 528 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 09:31:44] [INFO ] Invariant cache hit.
[2023-03-19 09:31:44] [INFO ] [Real]Absence check using 331 positive place invariants in 53 ms returned sat
[2023-03-19 09:31:45] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 09:31:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 88 ms returned sat
[2023-03-19 09:31:45] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 09:31:46] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-19 09:31:46] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 120 place count 751 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 121 place count 750 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 122 place count 749 transition count 539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 122 place count 749 transition count 537
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 126 place count 747 transition count 537
Applied a total of 126 rules in 67 ms. Remains 747 /753 variables (removed 6) and now considering 537/542 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 747/753 places, 537/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 229227 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 229227 steps, saw 221645 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 537 rows 747 cols
[2023-03-19 09:31:49] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:31:49] [INFO ] [Real]Absence check using 330 positive place invariants in 48 ms returned sat
[2023-03-19 09:31:49] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:31:50] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2023-03-19 09:31:50] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:31:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 09:31:50] [INFO ] After 49ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:31:50] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-19 09:31:50] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 537/537 transitions.
Applied a total of 0 rules in 41 ms. Remains 747 /747 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 747/747 places, 537/537 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 266865 steps, run visited all 1 properties in 2490 ms. (steps per millisecond=107 )
Probabilistic random walk after 266865 steps, saw 258418 distinct states, run finished after 2490 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (F (NOT p0)), (F (OR (NOT p2) p1)), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:31:54] [INFO ] Computed 331 place invariants in 3 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (F (NOT p0)), (F (OR (NOT p2) p1)), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-06 finished in 14990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Applied a total of 4 rules in 60 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:31:54] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:31:55] [INFO ] Implicit Places using invariants in 586 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 20 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:31:55] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:31:55] [INFO ] Implicit Places using invariants in 503 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 504 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 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 744 transition count 536
Applied a total of 4 rules in 53 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:31:56] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:31:56] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-19 09:31:56] [INFO ] Invariant cache hit.
[2023-03-19 09:31:57] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2855 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s343 0) (NEQ s603 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 635 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-07 finished in 3561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0||(!p1&&X(F(!p2))))))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Applied a total of 4 rules in 26 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:31:58] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:31:58] [INFO ] Implicit Places using invariants in 429 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 30 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:31:58] [INFO ] Computed 330 place invariants in 12 ms
[2023-03-19 09:31:59] [INFO ] Implicit Places using invariants in 580 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 582 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 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 744 transition count 536
Applied a total of 4 rules in 28 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:31:59] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:31:59] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 09:31:59] [INFO ] Invariant cache hit.
[2023-03-19 09:32:00] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2450 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), true, p2, (AND p0 p2), (AND p2 p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (EQ s53 0) (EQ s212 1)), p1:(OR (EQ s298 0) (EQ s697 1)), p2:(OR (EQ s568 0) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 580 ms.
Product exploration explored 100000 steps with 0 reset in 756 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 p0 p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 923 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:32:03] [INFO ] Invariant cache hit.
[2023-03-19 09:32:04] [INFO ] [Real]Absence check using 328 positive place invariants in 79 ms returned sat
[2023-03-19 09:32:04] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:32:04] [INFO ] [Nat]Absence check using 328 positive place invariants in 42 ms returned sat
[2023-03-19 09:32:04] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:32:05] [INFO ] After 721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-19 09:32:05] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 624 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (OR (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 15 factoid took 1218 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Stuttering acceptance computed with spot in 265 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
[2023-03-19 09:32:07] [INFO ] Invariant cache hit.
[2023-03-19 09:32:07] [INFO ] [Real]Absence check using 328 positive place invariants in 271 ms returned sat
[2023-03-19 09:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:32:07] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-03-19 09:32:08] [INFO ] Computed and/alt/rep : 535/1667/535 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-19 09:32:08] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 21 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-19 09:32:08] [INFO ] Invariant cache hit.
[2023-03-19 09:32:08] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-19 09:32:08] [INFO ] Invariant cache hit.
[2023-03-19 09:32:09] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2023-03-19 09:32:09] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 09:32:09] [INFO ] Invariant cache hit.
[2023-03-19 09:32:09] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1752 ms. Remains : 744/744 places, 536/536 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 p0 p2), (X (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p0))), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 525 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:32:10] [INFO ] Invariant cache hit.
[2023-03-19 09:32:11] [INFO ] [Real]Absence check using 328 positive place invariants in 124 ms returned sat
[2023-03-19 09:32:11] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:32:11] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2023-03-19 09:32:12] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:32:12] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-19 09:32:12] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 615 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 25 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p0))), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 599 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
[2023-03-19 09:32:13] [INFO ] Invariant cache hit.
[2023-03-19 09:32:13] [INFO ] [Real]Absence check using 328 positive place invariants in 145 ms returned sat
[2023-03-19 09:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:32:14] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-19 09:32:14] [INFO ] Computed and/alt/rep : 535/1667/535 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-19 09:32:14] [INFO ] Added : 0 causal constraints over 0 iterations in 93 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 96 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Product exploration explored 100000 steps with 0 reset in 545 ms.
Product exploration explored 100000 steps with 0 reset in 630 ms.
Built C files in :
/tmp/ltsmin15792988418070890292
[2023-03-19 09:32:15] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2023-03-19 09:32:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:15] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2023-03-19 09:32:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:15] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2023-03-19 09:32:15] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:15] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15792988418070890292
Running compilation step : cd /tmp/ltsmin15792988418070890292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1198 ms.
Running link step : cd /tmp/ltsmin15792988418070890292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15792988418070890292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11540843494997866329.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 27 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-19 09:32:30] [INFO ] Invariant cache hit.
[2023-03-19 09:32:31] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-19 09:32:31] [INFO ] Invariant cache hit.
[2023-03-19 09:32:32] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2023-03-19 09:32:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 09:32:32] [INFO ] Invariant cache hit.
[2023-03-19 09:32:32] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1876 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin15885122779563228569
[2023-03-19 09:32:32] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2023-03-19 09:32:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:32] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2023-03-19 09:32:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:32] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2023-03-19 09:32:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:32:32] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15885122779563228569
Running compilation step : cd /tmp/ltsmin15885122779563228569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1184 ms.
Running link step : cd /tmp/ltsmin15885122779563228569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15885122779563228569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8985032519223988935.hoa' '--buchi-type=spotba'
LTSmin run took 9557 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-08 finished in 44995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(!p1) U G(p0))))))'
Support contains 1 out of 753 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 541
Applied a total of 2 rules in 37 ms. Remains 752 /753 variables (removed 1) and now considering 541/542 (removed 1) transitions.
// Phase 1: matrix 541 rows 752 cols
[2023-03-19 09:32:43] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:32:43] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 09:32:43] [INFO ] Invariant cache hit.
[2023-03-19 09:32:44] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2023-03-19 09:32:44] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 09:32:44] [INFO ] Invariant cache hit.
[2023-03-19 09:32:45] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/753 places, 541/542 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1891 ms. Remains : 752/753 places, 541/542 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-09 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 s513 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 555 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-09 finished in 2543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 22 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:32:45] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:32:46] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 09:32:46] [INFO ] Invariant cache hit.
[2023-03-19 09:32:47] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2023-03-19 09:32:47] [INFO ] Invariant cache hit.
[2023-03-19 09:32:47] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1804 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s157 1)), p1:(OR (EQ s47 0) (EQ s157 1) (EQ s728 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 569 ms.
Product exploration explored 100000 steps with 0 reset in 766 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 p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 323349 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 323349 steps, saw 314504 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 09:32:53] [INFO ] Invariant cache hit.
[2023-03-19 09:32:53] [INFO ] [Real]Absence check using 331 positive place invariants in 88 ms returned sat
[2023-03-19 09:32:53] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:32:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 137 ms returned sat
[2023-03-19 09:32:54] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:32:54] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 09:32:54] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 121 place count 751 transition count 540
Applied a total of 121 rules in 37 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 359219 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359219 steps, saw 347734 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:32:57] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-19 09:32:57] [INFO ] [Real]Absence check using 331 positive place invariants in 63 ms returned sat
[2023-03-19 09:32:58] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:32:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 47 ms returned sat
[2023-03-19 09:32:58] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:32:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-19 09:32:58] [INFO ] After 71ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:32:58] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-19 09:32:58] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 751/751 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2023-03-19 09:32:59] [INFO ] Invariant cache hit.
[2023-03-19 09:32:59] [INFO ] Implicit Places using invariants in 663 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 677 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 540/540 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 14 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:32:59] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-19 09:33:00] [INFO ] Implicit Places using invariants in 434 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 746/751 places, 538/540 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 536
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 30 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:33:00] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:33:00] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-19 09:33:00] [INFO ] Invariant cache hit.
[2023-03-19 09:33:00] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:33:01] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 744/751 places, 536/540 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2951 ms. Remains : 744/751 places, 536/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384828 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384828 steps, saw 371828 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:33:05] [INFO ] Invariant cache hit.
[2023-03-19 09:33:05] [INFO ] [Real]Absence check using 328 positive place invariants in 92 ms returned sat
[2023-03-19 09:33:05] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:33:05] [INFO ] [Nat]Absence check using 328 positive place invariants in 60 ms returned sat
[2023-03-19 09:33:06] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:33:06] [INFO ] After 85ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:06] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-19 09:33:06] [INFO ] After 801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 571 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=95 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 29 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:33:07] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-19 09:33:07] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-19 09:33:07] [INFO ] Invariant cache hit.
[2023-03-19 09:33:08] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2023-03-19 09:33:08] [INFO ] Invariant cache hit.
[2023-03-19 09:33:08] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 753/753 places, 542/542 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 p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 344429 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 344429 steps, saw 334885 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 09:33:12] [INFO ] Invariant cache hit.
[2023-03-19 09:33:12] [INFO ] [Real]Absence check using 331 positive place invariants in 65 ms returned sat
[2023-03-19 09:33:13] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:33:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 66 ms returned sat
[2023-03-19 09:33:13] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:14] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-19 09:33:14] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 121 place count 751 transition count 540
Applied a total of 121 rules in 54 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384844 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384844 steps, saw 372931 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:33:17] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-19 09:33:17] [INFO ] [Real]Absence check using 331 positive place invariants in 62 ms returned sat
[2023-03-19 09:33:17] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:33:18] [INFO ] [Nat]Absence check using 331 positive place invariants in 77 ms returned sat
[2023-03-19 09:33:18] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-19 09:33:18] [INFO ] After 74ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:18] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-19 09:33:18] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 751/751 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2023-03-19 09:33:18] [INFO ] Invariant cache hit.
[2023-03-19 09:33:19] [INFO ] Implicit Places using invariants in 603 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 605 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 540/540 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 15 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:33:19] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-19 09:33:19] [INFO ] Implicit Places using invariants in 444 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 455 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 746/751 places, 538/540 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 536
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 31 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:33:19] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:33:20] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-19 09:33:20] [INFO ] Invariant cache hit.
[2023-03-19 09:33:20] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:33:21] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 744/751 places, 536/540 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3050 ms. Remains : 744/751 places, 536/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 373317 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373317 steps, saw 360509 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:33:24] [INFO ] Invariant cache hit.
[2023-03-19 09:33:25] [INFO ] [Real]Absence check using 328 positive place invariants in 90 ms returned sat
[2023-03-19 09:33:25] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:33:25] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2023-03-19 09:33:26] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:33:26] [INFO ] After 86ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:26] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-19 09:33:26] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 670 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 466 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 688 ms.
Product exploration explored 100000 steps with 0 reset in 816 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 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 753 transition count 542
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 165 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-19 09:33:29] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:33:29] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:33:29] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/753 places, 542/542 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 753/753 places, 542/542 transitions.
Built C files in :
/tmp/ltsmin3864212077743947626
[2023-03-19 09:33:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3864212077743947626
Running compilation step : cd /tmp/ltsmin3864212077743947626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin3864212077743947626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3864212077743947626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased639295800221138840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 29 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-19 09:33:44] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:33:45] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-19 09:33:45] [INFO ] Invariant cache hit.
[2023-03-19 09:33:46] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2023-03-19 09:33:46] [INFO ] Invariant cache hit.
[2023-03-19 09:33:47] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2305 ms. Remains : 753/753 places, 542/542 transitions.
Built C files in :
/tmp/ltsmin3763145228443973153
[2023-03-19 09:33:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3763145228443973153
Running compilation step : cd /tmp/ltsmin3763145228443973153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 962 ms.
Running link step : cd /tmp/ltsmin3763145228443973153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin3763145228443973153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9835658205448997813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:34:02] [INFO ] Flatten gal took : 32 ms
[2023-03-19 09:34:02] [INFO ] Flatten gal took : 26 ms
[2023-03-19 09:34:02] [INFO ] Time to serialize gal into /tmp/LTL12563866642045736238.gal : 5 ms
[2023-03-19 09:34:02] [INFO ] Time to serialize properties into /tmp/LTL4832936326074514616.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12563866642045736238.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16721114562065302864.hoa' '-atoms' '/tmp/LTL4832936326074514616.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4832936326074514616.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16721114562065302864.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:34:17] [INFO ] Flatten gal took : 37 ms
[2023-03-19 09:34:17] [INFO ] Flatten gal took : 30 ms
[2023-03-19 09:34:17] [INFO ] Time to serialize gal into /tmp/LTL860528545606316145.gal : 5 ms
[2023-03-19 09:34:17] [INFO ] Time to serialize properties into /tmp/LTL18339087821539644199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL860528545606316145.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18339087821539644199.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((p47==0)||(p157==1))||((p728==0)||(p152==1)))"))&&("((p47==0)||(p157==1))")))))
Formula 0 simplified : XG(!"((p47==0)||(p157==1))" | F!"(((p47==0)||(p157==1))||((p728==0)||(p152==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:34:32] [INFO ] Flatten gal took : 27 ms
[2023-03-19 09:34:32] [INFO ] Applying decomposition
[2023-03-19 09:34:32] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1178940802743937688.txt' '-o' '/tmp/graph1178940802743937688.bin' '-w' '/tmp/graph1178940802743937688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1178940802743937688.bin' '-l' '-1' '-v' '-w' '/tmp/graph1178940802743937688.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:34:32] [INFO ] Decomposing Gal with order
[2023-03-19 09:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:34:32] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-19 09:34:32] [INFO ] Flatten gal took : 66 ms
[2023-03-19 09:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 34 ms.
[2023-03-19 09:34:33] [INFO ] Time to serialize gal into /tmp/LTL13291083374262984236.gal : 11 ms
[2023-03-19 09:34:33] [INFO ] Time to serialize properties into /tmp/LTL10264802993656601352.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13291083374262984236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10264802993656601352.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((i0.i1.i0.u14.p47==0)||(i3.i1.i0.u50.p157==1))||((i20.u233.p728==0)||(i4.u48.p152==1)))"))&&("((i0.i1.i0.u14.p47==0)||(i3...181
Formula 0 simplified : XG(!"((i0.i1.i0.u14.p47==0)||(i3.i1.i0.u50.p157==1))" | F!"(((i0.i1.i0.u14.p47==0)||(i3.i1.i0.u50.p157==1))||((i20.u233.p728==0)||(i...173
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7880092341716200721
[2023-03-19 09:34:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7880092341716200721
Running compilation step : cd /tmp/ltsmin7880092341716200721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 852 ms.
Running link step : cd /tmp/ltsmin7880092341716200721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7880092341716200721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-10 finished in 137351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 26 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-19 09:35:03] [INFO ] Invariant cache hit.
[2023-03-19 09:35:03] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-19 09:35:03] [INFO ] Invariant cache hit.
[2023-03-19 09:35:04] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2023-03-19 09:35:04] [INFO ] Invariant cache hit.
[2023-03-19 09:35:05] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1963 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-12 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 s341 0) (EQ s474 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 1751 ms.
Product exploration explored 100000 steps with 50000 reset in 1783 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 :(X p0)
Knowledge based reduction with 3 factoid took 88 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-030A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-12 finished in 5692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-030A-LTLCardinality-01
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Applied a total of 4 rules in 76 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:35:09] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-19 09:35:09] [INFO ] Implicit Places using invariants in 469 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 32 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:35:09] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:35:10] [INFO ] Implicit Places using invariants in 441 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 442 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 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 744 transition count 536
Applied a total of 4 rules in 26 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:10] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:35:10] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-03-19 09:35:10] [INFO ] Invariant cache hit.
[2023-03-19 09:35:11] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2456 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s521 1), p1:(OR (EQ s381 0) (EQ s610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 509 ms.
Entered a terminal (fully accepting) state of product in 89628 steps with 0 reset in 625 ms.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-01 finished in 3864 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : ShieldPPPt-PT-030A-LTLCardinality-10
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 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 751 transition count 540
Applied a total of 4 rules in 30 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-19 09:35:13] [INFO ] Computed 331 place invariants in 10 ms
[2023-03-19 09:35:13] [INFO ] Implicit Places using invariants in 502 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 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 750 transition count 538
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 748 transition count 538
Applied a total of 4 rules in 17 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-19 09:35:13] [INFO ] Computed 330 place invariants in 7 ms
[2023-03-19 09:35:14] [INFO ] Implicit Places using invariants in 412 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 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 744 transition count 536
Applied a total of 4 rules in 25 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:14] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-19 09:35:14] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-19 09:35:14] [INFO ] Invariant cache hit.
[2023-03-19 09:35:15] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2208 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s157 1)), p1:(OR (EQ s47 0) (EQ s157 1) (EQ s728 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 537 ms.
Product exploration explored 100000 steps with 0 reset in 673 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 p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 2538 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 310927 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 310927 steps, saw 302171 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 09:35:22] [INFO ] Invariant cache hit.
[2023-03-19 09:35:22] [INFO ] [Real]Absence check using 328 positive place invariants in 133 ms returned sat
[2023-03-19 09:35:23] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:23] [INFO ] [Nat]Absence check using 328 positive place invariants in 91 ms returned sat
[2023-03-19 09:35:24] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:24] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 09:35:24] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 90 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 332135 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332135 steps, saw 322315 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:27] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:35:27] [INFO ] [Real]Absence check using 328 positive place invariants in 93 ms returned sat
[2023-03-19 09:35:28] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:28] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-19 09:35:28] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:35:28] [INFO ] After 115ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:28] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 09:35:28] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1036 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 35 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 17 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:29] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:35:30] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-19 09:35:30] [INFO ] Invariant cache hit.
[2023-03-19 09:35:31] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2023-03-19 09:35:31] [INFO ] Invariant cache hit.
[2023-03-19 09:35:32] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2304 ms. Remains : 744/744 places, 536/536 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 p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 300232 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 300232 steps, saw 291805 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-19 09:35:35] [INFO ] Invariant cache hit.
[2023-03-19 09:35:36] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-19 09:35:36] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:36] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-19 09:35:37] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:37] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 09:35:37] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 48 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347976 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347976 steps, saw 337879 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:40] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:35:40] [INFO ] [Real]Absence check using 328 positive place invariants in 51 ms returned sat
[2023-03-19 09:35:40] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 65 ms returned sat
[2023-03-19 09:35:41] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:41] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-19 09:35:41] [INFO ] After 168ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:41] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-19 09:35:41] [INFO ] After 887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1033 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 590 ms.
Product exploration explored 100000 steps with 0 reset in 818 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 31 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-19 09:35:44] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 536 rows 744 cols
[2023-03-19 09:35:44] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:35:44] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 560 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin16070796185846586978
[2023-03-19 09:35:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16070796185846586978
Running compilation step : cd /tmp/ltsmin16070796185846586978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 893 ms.
Running link step : cd /tmp/ltsmin16070796185846586978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16070796185846586978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16798562396518543802.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 25 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-19 09:36:00] [INFO ] Invariant cache hit.
[2023-03-19 09:36:00] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 09:36:00] [INFO ] Invariant cache hit.
[2023-03-19 09:36:01] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2023-03-19 09:36:01] [INFO ] Invariant cache hit.
[2023-03-19 09:36:01] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1490 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin5300713362753839009
[2023-03-19 09:36:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5300713362753839009
Running compilation step : cd /tmp/ltsmin5300713362753839009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 896 ms.
Running link step : cd /tmp/ltsmin5300713362753839009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin5300713362753839009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2906892966912620876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:36:16] [INFO ] Flatten gal took : 36 ms
[2023-03-19 09:36:16] [INFO ] Flatten gal took : 23 ms
[2023-03-19 09:36:16] [INFO ] Time to serialize gal into /tmp/LTL8887975204686596643.gal : 3 ms
[2023-03-19 09:36:16] [INFO ] Time to serialize properties into /tmp/LTL7120551817236182203.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8887975204686596643.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14844549215517748932.hoa' '-atoms' '/tmp/LTL7120551817236182203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7120551817236182203.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14844549215517748932.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:36:31] [INFO ] Flatten gal took : 62 ms
[2023-03-19 09:36:31] [INFO ] Flatten gal took : 29 ms
[2023-03-19 09:36:31] [INFO ] Time to serialize gal into /tmp/LTL5881083530634912347.gal : 5 ms
[2023-03-19 09:36:31] [INFO ] Time to serialize properties into /tmp/LTL7980663918400825520.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5881083530634912347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7980663918400825520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((p47==0)||(p157==1))||((p728==0)||(p152==1)))"))&&("((p47==0)||(p157==1))")))))
Formula 0 simplified : XG(!"((p47==0)||(p157==1))" | F!"(((p47==0)||(p157==1))||((p728==0)||(p152==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2023-03-19 09:36:47] [INFO ] Flatten gal took : 44 ms
[2023-03-19 09:36:47] [INFO ] Applying decomposition
[2023-03-19 09:36:47] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1677694704648022288.txt' '-o' '/tmp/graph1677694704648022288.bin' '-w' '/tmp/graph1677694704648022288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1677694704648022288.bin' '-l' '-1' '-v' '-w' '/tmp/graph1677694704648022288.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:36:47] [INFO ] Decomposing Gal with order
[2023-03-19 09:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:36:47] [INFO ] Removed a total of 89 redundant transitions.
[2023-03-19 09:36:47] [INFO ] Flatten gal took : 31 ms
[2023-03-19 09:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2023-03-19 09:36:47] [INFO ] Time to serialize gal into /tmp/LTL5589808486041167646.gal : 6 ms
[2023-03-19 09:36:47] [INFO ] Time to serialize properties into /tmp/LTL17077391278726790880.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5589808486041167646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17077391278726790880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((i1.u14.p47==0)||(i3.u50.p157==1))||((i18.u233.p728==0)||(i4.u48.p152==1)))"))&&("((i1.u14.p47==0)||(i3.u50.p157==1))")))...157
Formula 0 simplified : XG(!"((i1.u14.p47==0)||(i3.u50.p157==1))" | F!"(((i1.u14.p47==0)||(i3.u50.p157==1))||((i18.u233.p728==0)||(i4.u48.p152==1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5923658066984343571
[2023-03-19 09:37:02] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5923658066984343571
Running compilation step : cd /tmp/ltsmin5923658066984343571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 888 ms.
Running link step : cd /tmp/ltsmin5923658066984343571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin5923658066984343571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-10 finished in 124628 ms.
[2023-03-19 09:37:17] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4201128151433015374
[2023-03-19 09:37:17] [INFO ] Computing symmetric may disable matrix : 542 transitions.
[2023-03-19 09:37:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:37:17] [INFO ] Computing symmetric may enable matrix : 542 transitions.
[2023-03-19 09:37:17] [INFO ] Applying decomposition
[2023-03-19 09:37:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:37:17] [INFO ] Flatten gal took : 23 ms
[2023-03-19 09:37:17] [INFO ] Computing Do-Not-Accords matrix : 542 transitions.
[2023-03-19 09:37:17] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:37:17] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4201128151433015374
Running compilation step : cd /tmp/ltsmin4201128151433015374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1833079433124429575.txt' '-o' '/tmp/graph1833079433124429575.bin' '-w' '/tmp/graph1833079433124429575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1833079433124429575.bin' '-l' '-1' '-v' '-w' '/tmp/graph1833079433124429575.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:37:17] [INFO ] Decomposing Gal with order
[2023-03-19 09:37:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:37:17] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-19 09:37:17] [INFO ] Flatten gal took : 30 ms
[2023-03-19 09:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2023-03-19 09:37:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality15136713640986778173.gal : 9 ms
[2023-03-19 09:37:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality9691214926840759415.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15136713640986778173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9691214926840759415.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((i0.i1.i2.u14.p47==0)||(i3.i1.i0.u50.p157==1))")&&(G("(((i0.i1.i2.u14.p47==0)||(i3.i1.i0.u50.p157==1))||((i19.u233.p728==0)|...187
Formula 0 simplified : XG(!"((i0.i1.i2.u14.p47==0)||(i3.i1.i0.u50.p157==1))" | F!"(((i0.i1.i2.u14.p47==0)||(i3.i1.i0.u50.p157==1))||((i19.u233.p728==0)||(i...179
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin4201128151433015374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4201128151433015374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: LTL layer: formula: X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))
pins2lts-mc-linux64( 5/ 8), 0.047: "X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.047: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: There are 547 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.173: State length is 754, there are 548 groups
pins2lts-mc-linux64( 0/ 8), 0.173: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.173: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.173: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.173: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.229: [Blue] ~114 levels ~960 states ~3568 transitions
pins2lts-mc-linux64( 3/ 8), 0.282: [Blue] ~238 levels ~1920 states ~9472 transitions
pins2lts-mc-linux64( 3/ 8), 0.401: [Blue] ~478 levels ~3840 states ~22552 transitions
pins2lts-mc-linux64( 4/ 8), 0.553: [Blue] ~930 levels ~7680 states ~34888 transitions
pins2lts-mc-linux64( 2/ 8), 0.887: [Blue] ~1919 levels ~15360 states ~85368 transitions
pins2lts-mc-linux64( 2/ 8), 1.337: [Blue] ~3834 levels ~30720 states ~173184 transitions
pins2lts-mc-linux64( 2/ 8), 2.189: [Blue] ~7669 levels ~61440 states ~356288 transitions
pins2lts-mc-linux64( 2/ 8), 3.632: [Blue] ~15338 levels ~122880 states ~731760 transitions
pins2lts-mc-linux64( 0/ 8), 6.105: [Blue] ~30544 levels ~245760 states ~1530112 transitions
pins2lts-mc-linux64( 0/ 8), 10.682: [Blue] ~61058 levels ~491520 states ~3188568 transitions
pins2lts-mc-linux64( 0/ 8), 19.763: [Blue] ~121950 levels ~983040 states ~6624152 transitions
pins2lts-mc-linux64( 4/ 8), 38.079: [Blue] ~242965 levels ~1966080 states ~13198960 transitions
pins2lts-mc-linux64( 1/ 8), 63.658: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 64.010:
pins2lts-mc-linux64( 0/ 8), 64.011: Explored 3062839 states 24765514 transitions, fanout: 8.086
pins2lts-mc-linux64( 0/ 8), 64.011: Total exploration time 63.820 sec (63.500 sec minimum, 63.681 sec on average)
pins2lts-mc-linux64( 0/ 8), 64.011: States per second: 47992, Transitions per second: 388053
pins2lts-mc-linux64( 0/ 8), 64.011:
pins2lts-mc-linux64( 0/ 8), 64.011: State space has 13858983 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 64.011: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 64.011: blue states: 3062839 (22.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 64.011: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 64.011: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 64.011:
pins2lts-mc-linux64( 0/ 8), 64.011: Total memory used for local state coloring: 46.6MB
pins2lts-mc-linux64( 0/ 8), 64.011:
pins2lts-mc-linux64( 0/ 8), 64.011: Queue width: 8B, total height: 3052156, memory: 23.29MB
pins2lts-mc-linux64( 0/ 8), 64.011: Tree memory: 361.7MB, 27.4 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 64.011: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 64.011: Stored 698 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 64.011: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 64.011: Est. total memory use: 385.0MB (~1047.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4201128151433015374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4201128151433015374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2023-03-19 09:52:55] [INFO ] Applying decomposition
[2023-03-19 09:52:56] [INFO ] Flatten gal took : 536 ms
[2023-03-19 09:52:56] [INFO ] Decomposing Gal with order
[2023-03-19 09:52:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:52:58] [INFO ] Removed a total of 180 redundant transitions.
[2023-03-19 09:52:59] [INFO ] Flatten gal took : 551 ms
[2023-03-19 09:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 115 ms.
[2023-03-19 09:52:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality6841802819727627083.gal : 70 ms
[2023-03-19 09:52:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality11617986424622696738.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6841802819727627083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11617986424622696738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((u27.p47==0)||(i50.u88.p157==1))")&&(G("(((u27.p47==0)||(i50.u88.p157==1))||((u408.p728==0)||(u85.p152==1)))"))))))
Formula 0 simplified : XG(!"((u27.p47==0)||(i50.u88.p157==1))" | F!"(((u27.p47==0)||(i50.u88.p157==1))||((u408.p728==0)||(u85.p152==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1423 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,14.3702,422592,1,0,939851,830,7060,1.41122e+06,44,638,1644141
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1429399 ms.

BK_STOP 1679219598736

--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-030A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030A, 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 r389-oct2-167903713800643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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