Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 05:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 05:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716863381739

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-025025
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:29:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:29:43] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-28 02:29:43] [INFO ] Transformed 129 places.
[2024-05-28 02:29:43] [INFO ] Transformed 103 transitions.
[2024-05-28 02:29:43] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 103 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.
FORMULA RefineWMG-PT-025025-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 18 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:43] [INFO ] Computed 52 invariants in 14 ms
[2024-05-28 02:29:43] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
[2024-05-28 02:29:43] [INFO ] Invariant cache hit.
[2024-05-28 02:29:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-28 02:29:43] [INFO ] Invariant cache hit.
[2024-05-28 02:29:43] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-28 02:29:43] [INFO ] Invariant cache hit.
[2024-05-28 02:29:43] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 40 out of 129 places after structural reductions.
[2024-05-28 02:29:44] [INFO ] Flatten gal took : 27 ms
[2024-05-28 02:29:44] [INFO ] Flatten gal took : 11 ms
[2024-05-28 02:29:44] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 37 out of 129 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-28 02:29:44] [INFO ] Invariant cache hit.
[2024-05-28 02:29:44] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-28 02:29:44] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-28 02:29:45] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-28 02:29:45] [INFO ] After 389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-28 02:29:45] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Finished Parikh walk after 643 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=214 )
Parikh walk visited 15 properties in 99 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 99 place count 31 transition count 31
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 22 rules applied. Total rules applied 121 place count 31 transition count 9
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 8 transition count 8
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 3 with 2 rules applied. Total rules applied 147 place count 7 transition count 7
Applied a total of 147 rules in 13 ms. Remains 7 /129 variables (removed 122) and now considering 7/103 (removed 96) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:29:45] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:29:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:29:45] [INFO ] Invariant cache hit.
[2024-05-28 02:29:45] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:29:45] [INFO ] Invariant cache hit.
[2024-05-28 02:29:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-28 02:29:45] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:29:45] [INFO ] Invariant cache hit.
[2024-05-28 02:29:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/129 places, 7/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 7/129 places, 7/103 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 8 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-00 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1 U X(p2))||p0)))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:46] [INFO ] Computed 52 invariants in 2 ms
[2024-05-28 02:29:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
[2024-05-28 02:29:46] [INFO ] Invariant cache hit.
[2024-05-28 02:29:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 02:29:46] [INFO ] Invariant cache hit.
[2024-05-28 02:29:46] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-28 02:29:46] [INFO ] Invariant cache hit.
[2024-05-28 02:29:46] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT s51 s6) (LEQ s100 s126)), p1:(LEQ s100 s126), p2:(OR (LEQ s1 s82) (LEQ s51 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 470 ms.
Product exploration explored 100000 steps with 0 reset in 513 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 262583 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262583 steps, saw 232595 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-28 02:29:50] [INFO ] Invariant cache hit.
[2024-05-28 02:29:50] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-28 02:29:50] [INFO ] [Nat]Absence check using 52 positive place invariants in 9 ms returned sat
[2024-05-28 02:29:51] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-28 02:29:51] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-28 02:29:51] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1295 steps, including 0 resets, run visited all 4 properties in 23 ms. (steps per millisecond=56 )
Parikh walk visited 3 properties in 22 ms.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 81 transition count 55
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 88 place count 39 transition count 34
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 104 place count 39 transition count 18
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 120 place count 23 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 23 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 19 transition count 14
Applied a total of 128 rules in 11 ms. Remains 19 /129 variables (removed 110) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-28 02:29:51] [INFO ] Computed 7 invariants in 1 ms
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 19/129 places, 14/103 transitions.
Finished random walk after 315 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=315 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:29:51] [INFO ] Computed 52 invariants in 3 ms
[2024-05-28 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:51] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-28 02:29:51] [INFO ] Invariant cache hit.
[2024-05-28 02:29:52] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 129/129 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 244073 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244073 steps, saw 216482 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-28 02:29:55] [INFO ] Invariant cache hit.
[2024-05-28 02:29:55] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-28 02:29:55] [INFO ] [Nat]Absence check using 52 positive place invariants in 5 ms returned sat
[2024-05-28 02:29:55] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-28 02:29:55] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-28 02:29:55] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1301 steps, including 0 resets, run visited all 4 properties in 28 ms. (steps per millisecond=46 )
Parikh walk visited 3 properties in 28 ms.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 81 transition count 55
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 88 place count 39 transition count 34
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 104 place count 39 transition count 18
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 120 place count 23 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 23 transition count 14
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 19 transition count 14
Applied a total of 128 rules in 7 ms. Remains 19 /129 variables (removed 110) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-28 02:29:55] [INFO ] Computed 7 invariants in 2 ms
[2024-05-28 02:29:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 19/129 places, 14/103 transitions.
Finished random walk after 457 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=457 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 236 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 0 reset in 389 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 81 transition count 56
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 45 rules in 7 ms. Remains 81 /129 variables (removed 48) and now considering 56/103 (removed 47) transitions.
// Phase 1: matrix 56 rows 81 cols
[2024-05-28 02:29:57] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 02:29:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-28 02:29:57] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:29:57] [INFO ] Invariant cache hit.
[2024-05-28 02:29:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/129 places, 56/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 81/129 places, 56/103 transitions.
Built C files in :
/tmp/ltsmin14009637166990524749
[2024-05-28 02:29:57] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14009637166990524749
Running compilation step : cd /tmp/ltsmin14009637166990524749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 260 ms.
Running link step : cd /tmp/ltsmin14009637166990524749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14009637166990524749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5203338097930695193.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:30:12] [INFO ] Computed 52 invariants in 5 ms
[2024-05-28 02:30:12] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
[2024-05-28 02:30:12] [INFO ] Invariant cache hit.
[2024-05-28 02:30:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 02:30:13] [INFO ] Invariant cache hit.
[2024-05-28 02:30:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-28 02:30:13] [INFO ] Invariant cache hit.
[2024-05-28 02:30:13] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 129/129 places, 103/103 transitions.
Built C files in :
/tmp/ltsmin6721650607219459007
[2024-05-28 02:30:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6721650607219459007
Running compilation step : cd /tmp/ltsmin6721650607219459007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin6721650607219459007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6721650607219459007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11825561015070906433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:30:28] [INFO ] Flatten gal took : 8 ms
[2024-05-28 02:30:28] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:30:28] [INFO ] Time to serialize gal into /tmp/LTL5969268469918347111.gal : 2 ms
[2024-05-28 02:30:28] [INFO ] Time to serialize properties into /tmp/LTL3835856809419332706.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5969268469918347111.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5681273515051471361.hoa' '-atoms' '/tmp/LTL3835856809419332706.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((p48>p3)||(p97<=p123))")||(("(p97<=p123)")U(X("((pprime<=p79)||(p48<=p3))"))))))
Formula 0 simplified : F(!"((p48>p3)||(p97<=p123))" & (!"(p97<=p123)" R X!"((pprime<=p79)||(p48<=p3))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:30:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:30:58] [INFO ] Applying decomposition
[2024-05-28 02:30:58] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14527770912027477129.txt' '-o' '/tmp/graph14527770912027477129.bin' '-w' '/tmp/graph14527770912027477129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14527770912027477129.bin' '-l' '-1' '-v' '-w' '/tmp/graph14527770912027477129.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:30:58] [INFO ] Decomposing Gal with order
[2024-05-28 02:30:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:30:58] [INFO ] Flatten gal took : 27 ms
[2024-05-28 02:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 02:30:58] [INFO ] Time to serialize gal into /tmp/LTL3289712280192360399.gal : 3 ms
[2024-05-28 02:30:58] [INFO ] Time to serialize properties into /tmp/LTL7912768564012495537.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3289712280192360399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7912768564012495537.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((gu23.p48>gu23.p3)||(gu57.p97<=gu57.p123))")||(("(gu57.p97<=gu57.p123)")U(X("((gu0.pprime<=gu0.p79)||(gu23.p48<=gu23.p3))"))))...157
Formula 0 simplified : F(!"((gu23.p48>gu23.p3)||(gu57.p97<=gu57.p123))" & (!"(gu57.p97<=gu57.p123)" R X!"((gu0.pprime<=gu0.p79)||(gu23.p48<=gu23.p3))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5058638498497204726
[2024-05-28 02:31:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5058638498497204726
Running compilation step : cd /tmp/ltsmin5058638498497204726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin5058638498497204726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5058638498497204726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp1==true) U X((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-025025-LTLCardinality-01 finished in 102661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 72 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 96 place count 33 transition count 32
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 116 place count 33 transition count 12
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 13 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 142 place count 10 transition count 9
Applied a total of 142 rules in 11 ms. Remains 10 /129 variables (removed 119) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:31:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:31:28] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:31:28] [INFO ] Invariant cache hit.
[2024-05-28 02:31:28] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:31:28] [INFO ] Invariant cache hit.
[2024-05-28 02:31:28] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-28 02:31:28] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:31:28] [INFO ] Invariant cache hit.
[2024-05-28 02:31:28] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 9/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 10/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s5), p0:(LEQ 1 s8)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-03 finished in 174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F((p1&&F(p2))))||p0))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 68 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 94 place count 37 transition count 36
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 15 rules applied. Total rules applied 109 place count 37 transition count 21
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 125 place count 22 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 21 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 126 place count 21 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 132 place count 18 transition count 17
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 4 with 2 rules applied. Total rules applied 134 place count 17 transition count 16
Applied a total of 134 rules in 13 ms. Remains 17 /129 variables (removed 112) and now considering 16/103 (removed 87) transitions.
// Phase 1: matrix 16 rows 17 cols
[2024-05-28 02:31:28] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:31:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:31:28] [INFO ] Invariant cache hit.
[2024-05-28 02:31:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:31:29] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/129 places, 16/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 17/129 places, 16/103 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s16 s13) (LEQ s13 s8)), p2:(GT s11 s6), p1:(GT s13 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 190 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-04 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:31:29] [INFO ] Computed 52 invariants in 2 ms
[2024-05-28 02:31:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:29] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:29] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s46 s27), p0:(GT 3 s20)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1109 reset in 400 ms.
Stack based approach found an accepted trace after 55 steps with 4 reset with depth 48 and stack size 48 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-05 finished in 760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:31:29] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s118 s8), p0:(LEQ 2 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 722 reset in 360 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-06 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(p2))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-28 02:31:30] [INFO ] Invariant cache hit.
[2024-05-28 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 2 s73), p2:(AND (LEQ s4 s8) (LEQ s101 s128)), p0:(GT 1 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-025025-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-09 finished in 912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 98 place count 33 transition count 33
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 118 place count 33 transition count 13
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 138 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 138 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 11 transition count 11
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 3 with 2 rules applied. Total rules applied 144 place count 10 transition count 10
Applied a total of 144 rules in 12 ms. Remains 10 /129 variables (removed 119) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:31:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:31:31] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 10/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 10/129 places, 10/103 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-10 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:(LEQ s5 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-10 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 100 place count 29 transition count 29
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 119 place count 29 transition count 10
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 139 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 8 transition count 8
Applied a total of 142 rules in 10 ms. Remains 8 /129 variables (removed 121) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-28 02:31:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 02:31:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/129 places, 8/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 8/129 places, 8/103 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-11 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:31:31] [INFO ] Computed 52 invariants in 1 ms
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s106), p0:(AND (GT 1 s106) (GT 1 s76))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-12 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s111), p0:(OR (LEQ s126 s88) (LEQ 1 s111))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 357 ms.
Product exploration explored 100000 steps with 0 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10016 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 429097 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 429097 steps, saw 378964 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-28 02:31:36] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:31:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-28 02:31:36] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 02:31:36] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-28 02:31:36] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1075 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 18 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 129/129 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 463472 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463472 steps, saw 409186 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:31:40] [INFO ] Invariant cache hit.
[2024-05-28 02:31:41] [INFO ] [Real]Absence check using 52 positive place invariants in 5 ms returned sat
[2024-05-28 02:31:41] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:31:41] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2024-05-28 02:31:41] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 02:31:41] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-28 02:31:41] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1077 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=76 )
Parikh walk visited 2 properties in 14 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 391 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 81 transition count 56
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 47 rules in 11 ms. Remains 81 /129 variables (removed 48) and now considering 56/103 (removed 47) transitions.
// Phase 1: matrix 56 rows 81 cols
[2024-05-28 02:31:42] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 02:31:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-28 02:31:42] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:31:42] [INFO ] Invariant cache hit.
[2024-05-28 02:31:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/129 places, 56/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 81/129 places, 56/103 transitions.
Built C files in :
/tmp/ltsmin2632899034253597379
[2024-05-28 02:31:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2632899034253597379
Running compilation step : cd /tmp/ltsmin2632899034253597379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin2632899034253597379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2632899034253597379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7219762164604401554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2024-05-28 02:31:58] [INFO ] Computed 52 invariants in 1 ms
[2024-05-28 02:31:58] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2024-05-28 02:31:58] [INFO ] Invariant cache hit.
[2024-05-28 02:31:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 02:31:58] [INFO ] Invariant cache hit.
[2024-05-28 02:31:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-28 02:31:58] [INFO ] Invariant cache hit.
[2024-05-28 02:31:58] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 129/129 places, 103/103 transitions.
Built C files in :
/tmp/ltsmin12838042216024331760
[2024-05-28 02:31:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12838042216024331760
Running compilation step : cd /tmp/ltsmin12838042216024331760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin12838042216024331760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12838042216024331760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11615545087816475500.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:32:13] [INFO ] Flatten gal took : 8 ms
[2024-05-28 02:32:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:32:13] [INFO ] Time to serialize gal into /tmp/LTL15704592182782722290.gal : 1 ms
[2024-05-28 02:32:13] [INFO ] Time to serialize properties into /tmp/LTL3432573411531064836.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15704592182782722290.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4534531464823549614.hoa' '-atoms' '/tmp/LTL3432573411531064836.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p123<=p85)||(p108>=1))")||(X(G("(p108>=1)")))))))
Formula 0 simplified : XF(!"((p123<=p85)||(p108>=1))" & XF!"(p108>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:32:43] [INFO ] Flatten gal took : 10 ms
[2024-05-28 02:32:43] [INFO ] Applying decomposition
[2024-05-28 02:32:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6502245139974661769.txt' '-o' '/tmp/graph6502245139974661769.bin' '-w' '/tmp/graph6502245139974661769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6502245139974661769.bin' '-l' '-1' '-v' '-w' '/tmp/graph6502245139974661769.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:32:43] [INFO ] Decomposing Gal with order
[2024-05-28 02:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:32:43] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-28 02:32:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 02:32:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 02:32:43] [INFO ] Time to serialize gal into /tmp/LTL15345441821064099224.gal : 2 ms
[2024-05-28 02:32:43] [INFO ] Time to serialize properties into /tmp/LTL16365338239423781730.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15345441821064099224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16365338239423781730.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((gu60.p123<=gu60.p85)||(gi3.gu52.p108>=1))")||(X(G("(gi3.gu52.p108>=1)")))))))
Formula 0 simplified : XF(!"((gu60.p123<=gu60.p85)||(gi3.gu52.p108>=1))" & XF!"(gi3.gu52.p108>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5117989827315300932
[2024-05-28 02:32:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5117989827315300932
Running compilation step : cd /tmp/ltsmin5117989827315300932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 182 ms.
Running link step : cd /tmp/ltsmin5117989827315300932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5117989827315300932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X([]((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-025025-LTLCardinality-13 finished in 101458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(X(p1))))||(G(p2)&&X(F(p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 02:33:13] [INFO ] Invariant cache hit.
[2024-05-28 02:33:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2024-05-28 02:33:13] [INFO ] Invariant cache hit.
[2024-05-28 02:33:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 02:33:13] [INFO ] Invariant cache hit.
[2024-05-28 02:33:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-28 02:33:13] [INFO ] Invariant cache hit.
[2024-05-28 02:33:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ s121 s82), p0:(AND (LEQ 1 s122) (LEQ 1 s76)), p1:(LEQ 1 s122)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 10 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-025025-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-14 finished in 1148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 68 edges and 129 vertex of which 44 / 129 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 85 transition count 60
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 94 place count 37 transition count 36
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 14 rules applied. Total rules applied 108 place count 37 transition count 22
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 123 place count 23 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 22 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 124 place count 22 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 19 transition count 18
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 4 with 2 rules applied. Total rules applied 132 place count 18 transition count 17
Applied a total of 132 rules in 10 ms. Remains 18 /129 variables (removed 111) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 18 cols
[2024-05-28 02:33:14] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:33:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:33:14] [INFO ] Invariant cache hit.
[2024-05-28 02:33:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:33:14] [INFO ] Invariant cache hit.
[2024-05-28 02:33:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:33:15] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:33:15] [INFO ] Invariant cache hit.
[2024-05-28 02:33:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/129 places, 17/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 18/129 places, 17/103 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s14 s16), p1:(AND (LEQ s5 s12) (LEQ 3 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-15 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p1 U X(p2))||p0)))'
Found a Lengthening insensitive property : RefineWMG-PT-025025-LTLCardinality-01
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 87 place count 39 transition count 35
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 103 place count 39 transition count 19
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 119 place count 23 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 119 place count 23 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 19 transition count 15
Applied a total of 127 rules in 8 ms. Remains 19 /129 variables (removed 110) and now considering 15/103 (removed 88) transitions.
// Phase 1: matrix 15 rows 19 cols
[2024-05-28 02:33:15] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:33:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:33:15] [INFO ] Invariant cache hit.
[2024-05-28 02:33:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:33:15] [INFO ] Invariant cache hit.
[2024-05-28 02:33:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:33:15] [INFO ] Invariant cache hit.
[2024-05-28 02:33:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/129 places, 15/103 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 105 ms. Remains : 19/129 places, 15/103 transitions.
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT s9 s6) (LEQ s14 s18)), p1:(LEQ s14 s18), p2:(OR (LEQ s1 s11) (LEQ s9 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:33:16] [INFO ] Invariant cache hit.
[2024-05-28 02:33:16] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 02:33:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-28 02:33:16] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 02:33:16] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 02:33:16] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 130 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19/19 places, 15/15 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 14
Applied a total of 1 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-28 02:33:16] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:33:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 19/19 places, 14/15 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3163718 steps, run timeout after 3001 ms. (steps per millisecond=1054 ) properties seen :{}
Probabilistic random walk after 3163718 steps, saw 1546553 distinct states, run finished after 3001 ms. (steps per millisecond=1054 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:33:19] [INFO ] Invariant cache hit.
[2024-05-28 02:33:19] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:33:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-28 02:33:19] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:33:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-28 02:33:19] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 199 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=199 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 235 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 19 cols
[2024-05-28 02:33:19] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:33:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:33:19] [INFO ] Invariant cache hit.
[2024-05-28 02:33:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:33:19] [INFO ] Invariant cache hit.
[2024-05-28 02:33:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:33:19] [INFO ] Invariant cache hit.
[2024-05-28 02:33:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 19/19 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:33:20] [INFO ] Invariant cache hit.
[2024-05-28 02:33:20] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 02:33:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-28 02:33:20] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 02:33:20] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 02:33:20] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 127 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19/19 places, 15/15 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 14
Applied a total of 1 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-28 02:33:20] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:33:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 19/19 places, 14/15 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3150746 steps, run timeout after 3001 ms. (steps per millisecond=1049 ) properties seen :{}
Probabilistic random walk after 3150746 steps, saw 1540676 distinct states, run finished after 3001 ms. (steps per millisecond=1049 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:33:23] [INFO ] Invariant cache hit.
[2024-05-28 02:33:23] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:33:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-28 02:33:23] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:33:23] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 02:33:23] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 198 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=198 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true]
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 19 cols
[2024-05-28 02:33:24] [INFO ] Computed 7 invariants in 0 ms
[2024-05-28 02:33:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:33:24] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:33:24] [INFO ] Invariant cache hit.
[2024-05-28 02:33:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 19/19 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin15559497101943620032
[2024-05-28 02:33:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15559497101943620032
Running compilation step : cd /tmp/ltsmin15559497101943620032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin15559497101943620032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15559497101943620032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1014301486344982278.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-28 02:33:39] [INFO ] Invariant cache hit.
[2024-05-28 02:33:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:33:39] [INFO ] Invariant cache hit.
[2024-05-28 02:33:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:33:39] [INFO ] Invariant cache hit.
[2024-05-28 02:33:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 02:33:39] [INFO ] Invariant cache hit.
[2024-05-28 02:33:39] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 19/19 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin16152989089147186318
[2024-05-28 02:33:39] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16152989089147186318
Running compilation step : cd /tmp/ltsmin16152989089147186318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin16152989089147186318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16152989089147186318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2341477537456878091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:33:54] [INFO ] Flatten gal took : 2 ms
[2024-05-28 02:33:55] [INFO ] Flatten gal took : 1 ms
[2024-05-28 02:33:55] [INFO ] Time to serialize gal into /tmp/LTL3429585939652261100.gal : 0 ms
[2024-05-28 02:33:55] [INFO ] Time to serialize properties into /tmp/LTL7783267926987020135.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3429585939652261100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7568101264938241322.hoa' '-atoms' '/tmp/LTL7783267926987020135.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7783267926987020135.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7568101264938241322.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
53 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,0.553195,31172,1,0,9,91802,29,0,908,101735,26
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property RefineWMG-PT-025025-LTLCardinality-01 finished in 40438 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Found a Lengthening insensitive property : RefineWMG-PT-025025-LTLCardinality-13
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 48 / 129 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 81 transition count 56
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 93 place count 35 transition count 33
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 112 place count 35 transition count 14
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 131 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 131 place count 16 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 14 transition count 12
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 3 with 2 rules applied. Total rules applied 137 place count 13 transition count 11
Applied a total of 137 rules in 9 ms. Remains 13 /129 variables (removed 116) and now considering 11/103 (removed 92) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 02:33:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:33:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:33:55] [INFO ] Invariant cache hit.
[2024-05-28 02:33:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:33:55] [INFO ] Invariant cache hit.
[2024-05-28 02:33:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 02:33:55] [INFO ] Invariant cache hit.
[2024-05-28 02:33:55] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/129 places, 11/103 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 98 ms. Remains : 13/129 places, 11/103 transitions.
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s9), p0:(OR (LEQ s12 s6) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10011 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished Best-First random walk after 1217 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=304 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-28 02:33:56] [INFO ] Invariant cache hit.
[2024-05-28 02:33:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:33:56] [INFO ] Invariant cache hit.
[2024-05-28 02:33:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:33:56] [INFO ] Invariant cache hit.
[2024-05-28 02:33:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:33:56] [INFO ] Invariant cache hit.
[2024-05-28 02:33:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 13/13 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 2) seen :0
Finished Best-First random walk after 1215 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=405 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-28 02:33:58] [INFO ] Invariant cache hit.
[2024-05-28 02:33:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-28 02:33:58] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:33:58] [INFO ] Invariant cache hit.
[2024-05-28 02:33:58] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 13/13 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin6543797336895253440
[2024-05-28 02:33:58] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6543797336895253440
Running compilation step : cd /tmp/ltsmin6543797336895253440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin6543797336895253440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6543797336895253440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13599865654363824161.hoa' '--buchi-type=spotba'
LTSmin run took 8352 ms.
Treatment of property RefineWMG-PT-025025-LTLCardinality-13 finished in 10947 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-28 02:34:06] [INFO ] Flatten gal took : 4 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 263437 ms.

BK_STOP 1716863647511

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="RefineWMG-PT-025025"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is RefineWMG-PT-025025, 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 r329-tall-171662362300452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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