About the Execution of 2023-gold for RefineWMG-PT-100101
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7881.260 | 3600000.00 | 5328006.00 | 7571.50 | FFFFFFFF?FFFFFFF | normal |
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-171662362400477.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-100101, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362400477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.3K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 04:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 04:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 04:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 13 04:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 218K 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-100101-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716863680948
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-100101
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:34:42] [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:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:34:42] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-28 02:34:42] [INFO ] Transformed 504 places.
[2024-05-28 02:34:42] [INFO ] Transformed 403 transitions.
[2024-05-28 02:34:42] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RefineWMG-PT-100101-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 46 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:34:43] [INFO ] Computed 202 invariants in 10 ms
[2024-05-28 02:34:43] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
[2024-05-28 02:34:43] [INFO ] Invariant cache hit.
[2024-05-28 02:34:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 02:34:43] [INFO ] Invariant cache hit.
[2024-05-28 02:34:43] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-28 02:34:43] [INFO ] Invariant cache hit.
[2024-05-28 02:34:44] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1387 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 41 out of 504 places after structural reductions.
[2024-05-28 02:34:44] [INFO ] Flatten gal took : 55 ms
[2024-05-28 02:34:44] [INFO ] Flatten gal took : 26 ms
[2024-05-28 02:34:44] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) 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 16) seen :1
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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-28 02:34:44] [INFO ] Invariant cache hit.
[2024-05-28 02:34:44] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2024-05-28 02:34:44] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-28 02:34:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 40 ms returned sat
[2024-05-28 02:34:46] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-28 02:34:46] [INFO ] After 1163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 341 ms.
[2024-05-28 02:34:46] [INFO ] After 2025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Finished Parikh walk after 20723 steps, including 0 resets, run visited all 1 properties in 138 ms. (steps per millisecond=150 )
Parikh walk visited 14 properties in 1515 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-100101-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:34:48] [INFO ] Invariant cache hit.
[2024-05-28 02:34:49] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
[2024-05-28 02:34:49] [INFO ] Invariant cache hit.
[2024-05-28 02:34:49] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 02:34:49] [INFO ] Invariant cache hit.
[2024-05-28 02:34:49] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-28 02:34:49] [INFO ] Invariant cache hit.
[2024-05-28 02:34:49] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1041 ms. Remains : 504/504 places, 403/403 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 287 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s217 s100), p1:(LEQ 2 s412)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1543 ms.
Product exploration explored 100000 steps with 0 reset in 1701 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 (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Support contains 1 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 4 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 place count 14 transition count 13
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 589 place count 13 transition count 12
Applied a total of 589 rules in 32 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-28 02:34:53] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:34:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-28 02:34:53] [INFO ] Invariant cache hit.
[2024-05-28 02:34:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:34:53] [INFO ] Invariant cache hit.
[2024-05-28 02:34:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:34:53] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:34:53] [INFO ] Invariant cache hit.
[2024-05-28 02:34:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 13/504 places, 12/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 1008 steps with 0 reset in 6 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-01 finished in 5518 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((G(F(!(p0 U p1)))||X(X(G(p0))))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:34:54] [INFO ] Computed 202 invariants in 3 ms
[2024-05-28 02:34:54] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
[2024-05-28 02:34:54] [INFO ] Invariant cache hit.
[2024-05-28 02:34:54] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 02:34:54] [INFO ] Invariant cache hit.
[2024-05-28 02:34:54] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-28 02:34:54] [INFO ] Invariant cache hit.
[2024-05-28 02:34:55] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 868 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s156 s289), p1:(LEQ s282 s217)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 196 reset in 1249 ms.
Stack based approach found an accepted trace after 313 steps with 0 reset with depth 314 and stack size 314 in 4 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-02 finished in 2344 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)&&X(X(X(p1))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:34:56] [INFO ] Invariant cache hit.
[2024-05-28 02:34:56] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
[2024-05-28 02:34:56] [INFO ] Invariant cache hit.
[2024-05-28 02:34:57] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-28 02:34:57] [INFO ] Invariant cache hit.
[2024-05-28 02:34:57] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-28 02:34:57] [INFO ] Invariant cache hit.
[2024-05-28 02:34:57] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 965 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s7), p1:(GT s481 s416)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-03 finished in 1185 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(((p0 U G(p1))||X(X(p1)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:34:57] [INFO ] Invariant cache hit.
[2024-05-28 02:34:57] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2024-05-28 02:34:57] [INFO ] Invariant cache hit.
[2024-05-28 02:34:58] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 02:34:58] [INFO ] Invariant cache hit.
[2024-05-28 02:34:58] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-05-28 02:34:58] [INFO ] Invariant cache hit.
[2024-05-28 02:34:58] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 845 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 s472), p1:(LEQ s94 s135)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25029 reset in 831 ms.
Product exploration explored 100000 steps with 24940 reset in 869 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), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:35:01] [INFO ] Invariant cache hit.
[2024-05-28 02:35:01] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:35:01] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2024-05-28 02:35:01] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:35:01] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-28 02:35:01] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 5213 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=133 )
Parikh walk visited 3 properties in 213 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100101-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100101-LTLCardinality-05 finished in 4508 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(p0) U p1)||G(p2)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 2 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 489 place count 110 transition count 15
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 2 with 94 rules applied. Total rules applied 583 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 583 place count 16 transition count 13
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 587 place count 14 transition count 13
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 589 place count 13 transition count 12
Applied a total of 589 rules in 20 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-28 02:35:02] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-28 02:35:02] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ 2 s12) (LEQ 2 s8)), p0:(LEQ 2 s8), p2:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-06 finished in 398 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(F(p0))&&X(G(F((X(p1) U p2))))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 392 place count 112 transition count 110
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 1 with 91 rules applied. Total rules applied 483 place count 112 transition count 19
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 574 place count 21 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 574 place count 21 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 582 place count 17 transition count 15
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 584 place count 16 transition count 14
Applied a total of 584 rules in 16 ms. Remains 16 /504 variables (removed 488) and now considering 14/403 (removed 389) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:35:02] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:35:02] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:35:02] [INFO ] Invariant cache hit.
[2024-05-28 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/504 places, 14/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 16/504 places, 14/403 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s14 s11), p2:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-07 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:35:03] [INFO ] Computed 202 invariants in 3 ms
[2024-05-28 02:35:03] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
[2024-05-28 02:35:03] [INFO ] Invariant cache hit.
[2024-05-28 02:35:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 02:35:03] [INFO ] Invariant cache hit.
[2024-05-28 02:35:03] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-28 02:35:03] [INFO ] Invariant cache hit.
[2024-05-28 02:35:03] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 860 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p0:(GT s402 s487), p2:(GT s110 s108), p1:(LEQ 1 s221)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 272 reset in 1267 ms.
Product exploration explored 100000 steps with 262 reset in 1383 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 (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:35:07] [INFO ] Invariant cache hit.
[2024-05-28 02:35:07] [INFO ] [Real]Absence check using 202 positive place invariants in 23 ms returned sat
[2024-05-28 02:35:07] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:35:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2024-05-28 02:35:07] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:35:08] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-28 02:35:08] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 19296 steps, including 0 resets, run visited all 3 properties in 299 ms. (steps per millisecond=64 )
Parikh walk visited 3 properties in 298 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p2 p1)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p0)]
Knowledge based reduction with 4 factoid took 379 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:35:09] [INFO ] Invariant cache hit.
[2024-05-28 02:35:09] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2024-05-28 02:35:09] [INFO ] Invariant cache hit.
[2024-05-28 02:35:09] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 02:35:09] [INFO ] Invariant cache hit.
[2024-05-28 02:35:10] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-28 02:35:10] [INFO ] Invariant cache hit.
[2024-05-28 02:35:10] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 504/504 places, 403/403 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 (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10100 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=280 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:35:10] [INFO ] Invariant cache hit.
[2024-05-28 02:35:11] [INFO ] [Real]Absence check using 202 positive place invariants in 24 ms returned sat
[2024-05-28 02:35:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:35:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 23 ms returned sat
[2024-05-28 02:35:11] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:35:11] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-28 02:35:11] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 19508 steps, including 0 resets, run visited all 3 properties in 270 ms. (steps per millisecond=72 )
Parikh walk visited 3 properties in 271 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 368 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 301 reset in 1205 ms.
Product exploration explored 100000 steps with 362 reset in 1299 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 292 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 195 place count 310 transition count 210
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 195 rules in 36 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2024-05-28 02:35:16] [INFO ] Computed 105 invariants in 1 ms
[2024-05-28 02:35:16] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
[2024-05-28 02:35:16] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 02:35:16] [INFO ] Invariant cache hit.
[2024-05-28 02:35:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 210/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 310/504 places, 210/403 transitions.
Built C files in :
/tmp/ltsmin763307436154740386
[2024-05-28 02:35:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin763307436154740386
Running compilation step : cd /tmp/ltsmin763307436154740386;'/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 660 ms.
Running link step : cd /tmp/ltsmin763307436154740386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin763307436154740386;'/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/stateBased4132783674038639645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:35:31] [INFO ] Computed 202 invariants in 1 ms
[2024-05-28 02:35:31] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2024-05-28 02:35:31] [INFO ] Invariant cache hit.
[2024-05-28 02:35:31] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 02:35:31] [INFO ] Invariant cache hit.
[2024-05-28 02:35:32] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-28 02:35:32] [INFO ] Invariant cache hit.
[2024-05-28 02:35:32] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin6671229165724508165
[2024-05-28 02:35:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6671229165724508165
Running compilation step : cd /tmp/ltsmin6671229165724508165;'/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 603 ms.
Running link step : cd /tmp/ltsmin6671229165724508165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6671229165724508165;'/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/stateBased10754650073959082756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:35:47] [INFO ] Flatten gal took : 23 ms
[2024-05-28 02:35:47] [INFO ] Flatten gal took : 22 ms
[2024-05-28 02:35:47] [INFO ] Time to serialize gal into /tmp/LTL5296191202868777981.gal : 4 ms
[2024-05-28 02:35:47] [INFO ] Time to serialize properties into /tmp/LTL1311642153924434546.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/LTL5296191202868777981.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16638681210369342676.hoa' '-atoms' '/tmp/LTL1311642153924434546.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/LTL1311642153924434546.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16638681210369342676.hoa
Detected timeout of ITS tools.
[2024-05-28 02:36:02] [INFO ] Flatten gal took : 19 ms
[2024-05-28 02:36:02] [INFO ] Flatten gal took : 17 ms
[2024-05-28 02:36:02] [INFO ] Time to serialize gal into /tmp/LTL11915730647276477701.gal : 4 ms
[2024-05-28 02:36:02] [INFO ] Time to serialize properties into /tmp/LTL11062505777026726426.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11915730647276477701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11062505777026726426.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 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
Detected timeout of ITS tools.
[2024-05-28 02:36:17] [INFO ] Flatten gal took : 19 ms
[2024-05-28 02:36:17] [INFO ] Applying decomposition
[2024-05-28 02:36:17] [INFO ] Flatten gal took : 17 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/graph5224934785906691101.txt' '-o' '/tmp/graph5224934785906691101.bin' '-w' '/tmp/graph5224934785906691101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5224934785906691101.bin' '-l' '-1' '-v' '-w' '/tmp/graph5224934785906691101.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:36:17] [INFO ] Decomposing Gal with order
[2024-05-28 02:36:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:36:17] [INFO ] Flatten gal took : 49 ms
[2024-05-28 02:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-28 02:36:18] [INFO ] Time to serialize gal into /tmp/LTL2319796525033664314.gal : 7 ms
[2024-05-28 02:36:18] [INFO ] Time to serialize properties into /tmp/LTL666316359689216391.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/LTL2319796525033664314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL666316359689216391.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...274
Read 1 LTL properties
Checking formula 0 : !(((F("(gu234.p399>gu234.p484)"))||(X((X("(gi2.gi2.gu104.p218>=1)"))U((X(G("(gi2.gi2.gu104.p218>=1)")))||(("(gu50.p107>gu50.p105)")&&(...225
Formula 0 simplified : G!"(gu234.p399>gu234.p484)" & X(X!"(gi2.gi2.gu104.p218>=1)" R (XF!"(gi2.gi2.gu104.p218>=1)" & (!"(gu50.p107>gu50.p105)" | X(!"(gi2.g...206
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10893336749950967046
[2024-05-28 02:36:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10893336749950967046
Running compilation step : cd /tmp/ltsmin10893336749950967046;'/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 612 ms.
Running link step : cd /tmp/ltsmin10893336749950967046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10893336749950967046;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-100101-LTLCardinality-08 finished in 105286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 491 place count 106 transition count 11
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 95 rules applied. Total rules applied 586 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 587 place count 11 transition count 8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 591 place count 9 transition count 8
Applied a total of 591 rules in 16 ms. Remains 9 /504 variables (removed 495) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-28 02:36:48] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:36:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:36:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/504 places, 8/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/504 places, 8/403 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-10 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1))&&F(p2))))'
Support contains 6 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 1 with 291 rules applied. Total rules applied 390 place count 112 transition count 109
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 1 with 86 rules applied. Total rules applied 476 place count 112 transition count 23
Reduce places removed 86 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 88 rules applied. Total rules applied 564 place count 26 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 566 place count 24 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 566 place count 24 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 572 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 574 place count 20 transition count 17
Applied a total of 574 rules in 19 ms. Remains 20 /504 variables (removed 484) and now considering 17/403 (removed 386) transitions.
// Phase 1: matrix 17 rows 20 cols
[2024-05-28 02:36:48] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:36:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:36:48] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/504 places, 17/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 20/504 places, 17/403 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s8 s13), p2:(GT s10 s5), p1:(LEQ s16 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-11 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-28 02:36:48] [INFO ] Computed 202 invariants in 4 ms
[2024-05-28 02:36:48] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
[2024-05-28 02:36:48] [INFO ] Invariant cache hit.
[2024-05-28 02:36:49] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 02:36:49] [INFO ] Invariant cache hit.
[2024-05-28 02:36:49] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-28 02:36:49] [INFO ] Invariant cache hit.
[2024-05-28 02:36:49] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 871 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(GT s479 s119), p0:(GT 2 s82)], 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 90 reset in 1226 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-12 finished in 2257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p0))))))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-28 02:36:50] [INFO ] Invariant cache hit.
[2024-05-28 02:36:51] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
[2024-05-28 02:36:51] [INFO ] Invariant cache hit.
[2024-05-28 02:36:51] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-28 02:36:51] [INFO ] Invariant cache hit.
[2024-05-28 02:36:51] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-28 02:36:51] [INFO ] Invariant cache hit.
[2024-05-28 02:36:51] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s444)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 1261 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 1 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 2275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(p1) U (X(G(p1))||(p2&&X((p1&&X(F(p2))))))))))'
[2024-05-28 02:36:53] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1452767701264444850
[2024-05-28 02:36:53] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2024-05-28 02:36:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:36:53] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2024-05-28 02:36:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:36:53] [INFO ] Applying decomposition
[2024-05-28 02:36:53] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:36:53] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
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/graph4179376264630745218.txt' '-o' '/tmp/graph4179376264630745218.bin' '-w' '/tmp/graph4179376264630745218.weights'
[2024-05-28 02:36:53] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4179376264630745218.bin' '-l' '-1' '-v' '-w' '/tmp/graph4179376264630745218.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:36:53] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1452767701264444850
Running compilation step : cd /tmp/ltsmin1452767701264444850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 02:36:53] [INFO ] Decomposing Gal with order
[2024-05-28 02:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:36:53] [INFO ] Flatten gal took : 20 ms
[2024-05-28 02:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 02:36:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality5202959282005816088.gal : 4 ms
[2024-05-28 02:36:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality13890513450099486821.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/LTLCardinality5202959282005816088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13890513450099486821.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...298
Read 1 LTL properties
Checking formula 0 : !(((F("(gu196.p399>gu196.p484)"))||(X((X("(gi3.gi1.gi2.gi0.gi0.gu106.p218>=1)"))U((X(G("(gi3.gi1.gi2.gi0.gi0.gu106.p218>=1)")))||(("(g...261
Formula 0 simplified : G!"(gu196.p399>gu196.p484)" & X(X!"(gi3.gi1.gi2.gi0.gi0.gu106.p218>=1)" R (XF!"(gi3.gi1.gi2.gi0.gi0.gu106.p218>=1)" & (!"(gu53.p107>...242
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin1452767701264444850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1452767701264444850;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: LTL layer: formula: (<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 2/ 8), 0.019: "(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.172: DFS-FIFO for weak LTL, using special progress label 407
pins2lts-mc-linux64( 0/ 8), 0.172: There are 408 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.172: State length is 505, there are 415 groups
pins2lts-mc-linux64( 0/ 8), 0.172: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.172: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.172: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.172: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.603: ~1 levels ~960 states ~92864 transitions
pins2lts-mc-linux64( 2/ 8), 0.938: ~1 levels ~1920 states ~189256 transitions
pins2lts-mc-linux64( 2/ 8), 1.397: ~1 levels ~3840 states ~383688 transitions
pins2lts-mc-linux64( 7/ 8), 2.067: ~1 levels ~7680 states ~769984 transitions
pins2lts-mc-linux64( 7/ 8), 3.016: ~1 levels ~15360 states ~1401824 transitions
pins2lts-mc-linux64( 7/ 8), 4.666: ~1 levels ~30720 states ~2784704 transitions
pins2lts-mc-linux64( 7/ 8), 7.435: ~1 levels ~61440 states ~5735400 transitions
pins2lts-mc-linux64( 7/ 8), 13.172: ~1 levels ~122880 states ~11892576 transitions
pins2lts-mc-linux64( 0/ 8), 25.063: ~1 levels ~245760 states ~24095760 transitions
pins2lts-mc-linux64( 2/ 8), 45.997: ~1 levels ~491520 states ~45141560 transitions
pins2lts-mc-linux64( 2/ 8), 93.027: ~1 levels ~983040 states ~92925376 transitions
pins2lts-mc-linux64( 7/ 8), 191.813: ~1 levels ~1966080 states ~192369520 transitions
pins2lts-mc-linux64( 4/ 8), 376.287: ~1 levels ~3932160 states ~386495200 transitions
pins2lts-mc-linux64( 5/ 8), 516.553: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 516.931:
pins2lts-mc-linux64( 0/ 8), 516.931: mean standard work distribution: 0.4% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 516.931:
pins2lts-mc-linux64( 0/ 8), 516.931: Explored 5148148 states 512932572 transitions, fanout: 99.634
pins2lts-mc-linux64( 0/ 8), 516.931: Total exploration time 516.740 sec (516.360 sec minimum, 516.459 sec on average)
pins2lts-mc-linux64( 0/ 8), 516.931: States per second: 9963, Transitions per second: 992632
pins2lts-mc-linux64( 0/ 8), 516.931:
pins2lts-mc-linux64( 0/ 8), 516.931: Progress states detected: 134216850
pins2lts-mc-linux64( 0/ 8), 516.931: Redundant explorations: -96.1643
pins2lts-mc-linux64( 0/ 8), 516.931:
pins2lts-mc-linux64( 0/ 8), 516.931: Queue width: 8B, total height: 159311713, memory: 1215.45MB
pins2lts-mc-linux64( 0/ 8), 516.931: Tree memory: 1092.4MB, 8.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 516.931: Tree fill ratio (roots/leafs): 99.0%/26.0%
pins2lts-mc-linux64( 0/ 8), 516.931: Stored 429 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 516.931: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 516.931: Est. total memory use: 2307.8MB (~2239.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1452767701264444850;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1452767701264444850;'/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' '(<>((LTLAPp0==true))||X((X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp2==true)&&X(((LTLAPp1==true)&&X(<>((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 02:57:36] [INFO ] Flatten gal took : 23 ms
[2024-05-28 02:57:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality17904511886671638632.gal : 2 ms
[2024-05-28 02:57:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality13389184876207205815.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/LTLCardinality17904511886671638632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13389184876207205815.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...299
Read 1 LTL properties
Checking formula 0 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 03:18:20] [INFO ] Flatten gal took : 15 ms
[2024-05-28 03:18:20] [INFO ] Input system was already deterministic with 403 transitions.
[2024-05-28 03:18:20] [INFO ] Transformed 504 places.
[2024-05-28 03:18:20] [INFO ] Transformed 403 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 03:18:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality14039464861415388487.gal : 4 ms
[2024-05-28 03:18:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality8277311002850184899.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/LTLCardinality14039464861415388487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8277311002850184899.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(p399>p484)"))||(X((X("(p218>=1)"))U((X(G("(p218>=1)")))||(("(p107>p105)")&&(X(("(p218>=1)")&&(X(F("(p107>p105)")))))))))))
Formula 0 simplified : G!"(p399>p484)" & X(X!"(p218>=1)" R (XF!"(p218>=1)" & (!"(p107>p105)" | X(!"(p218>=1)" | XG!"(p107>p105)"))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8239868 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039316 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-100101"
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-100101, 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-171662362400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 '
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 ;