About the Execution of ITS-Tools for RefineWMG-PT-100100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2062.063 | 121466.00 | 276219.00 | 85.10 | FTFTFTTFFFFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400571.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-100100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Apr 30 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 30 02:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 218K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-100100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653086534705
Running Version 202205111006
[2022-05-20 22:42:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:42:16] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2022-05-20 22:42:16] [INFO ] Transformed 504 places.
[2022-05-20 22:42:16] [INFO ] Transformed 403 transitions.
[2022-05-20 22:42:16] [INFO ] Parsed PT model containing 504 places and 403 transitions in 209 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-100100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 48 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:16] [INFO ] Computed 202 place invariants in 20 ms
[2022-05-20 22:42:16] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:16] [INFO ] Computed 202 place invariants in 6 ms
[2022-05-20 22:42:17] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:17] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:42:17] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:17] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:42:17] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Support contains 30 out of 504 places after structural reductions.
[2022-05-20 22:42:17] [INFO ] Flatten gal took : 74 ms
[2022-05-20 22:42:17] [INFO ] Flatten gal took : 37 ms
[2022-05-20 22:42:17] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=71 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:18] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:18] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 22:42:19] [INFO ] [Nat]Absence check using 202 positive place invariants in 30 ms returned sat
[2022-05-20 22:42:19] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-20 22:42:20] [INFO ] After 1102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 503 ms.
[2022-05-20 22:42:20] [INFO ] After 1873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 20739 steps, including 0 resets, run visited all 1 properties in 140 ms. (steps per millisecond=148 )
Parikh walk visited 10 properties in 3875 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 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 25 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:24] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:42:25] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:25] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:25] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:25] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:25] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:25] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:42:25] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s108 s118)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 207 reset in 1278 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 16 and stack size 16 in 2 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-00 finished in 2684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((p0 U X(p1))||X(F(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 9 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:27] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:42:27] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:27] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:28] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:28] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:42:29] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:29] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:29] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT s483 s109), p0:(LEQ s287 s483), p1:(LEQ s150 s370)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 866 reset in 1469 ms.
Product exploration explored 100000 steps with 775 reset in 1623 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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 481 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:34] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:34] [INFO ] [Real]Absence check using 202 positive place invariants in 42 ms returned sat
[2022-05-20 22:42:34] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 22:42:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 34 ms returned sat
[2022-05-20 22:42:34] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 22:42:34] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-05-20 22:42:35] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 5753 steps, including 0 resets, run visited all 3 properties in 124 ms. (steps per millisecond=46 )
Parikh walk visited 4 properties in 401 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 498 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT 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 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:36] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:42:36] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:36] [INFO ] Computed 202 place invariants in 14 ms
[2022-05-20 22:42:36] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:36] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:42:36] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:36] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:42:37] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 347 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
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 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:37] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:38] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 22:42:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 28 ms returned sat
[2022-05-20 22:42:38] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 22:42:38] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-20 22:42:38] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 5857 steps, including 0 resets, run visited all 3 properties in 153 ms. (steps per millisecond=38 )
Parikh walk visited 3 properties in 153 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 335 reset in 1204 ms.
Product exploration explored 100000 steps with 646 reset in 1703 ms.
Built C files in :
/tmp/ltsmin18078397768422404914
[2022-05-20 22:42:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18078397768422404914
Running compilation step : cd /tmp/ltsmin18078397768422404914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 791 ms.
Running link step : cd /tmp/ltsmin18078397768422404914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin18078397768422404914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6989496126187997833.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 17 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:58] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:42:58] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:58] [INFO ] Computed 202 place invariants in 4 ms
[2022-05-20 22:42:58] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:58] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:42:59] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:42:59] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:42:59] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin3497950164924361394
[2022-05-20 22:42:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3497950164924361394
Running compilation step : cd /tmp/ltsmin3497950164924361394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 511 ms.
Running link step : cd /tmp/ltsmin3497950164924361394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3497950164924361394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13288776120074314067.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 22:43:14] [INFO ] Flatten gal took : 20 ms
[2022-05-20 22:43:14] [INFO ] Flatten gal took : 50 ms
[2022-05-20 22:43:14] [INFO ] Time to serialize gal into /tmp/LTL17878622759726274218.gal : 28 ms
[2022-05-20 22:43:14] [INFO ] Time to serialize properties into /tmp/LTL12152810768482910080.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17878622759726274218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12152810768482910080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1787862...268
Read 1 LTL properties
Checking formula 0 : !((X(F(G((("(p284<=p480)")U(X("(p147<=p367)")))||(X(F(F("(p480>p106)")))))))))
Formula 0 simplified : !XFG(("(p284<=p480)" U X"(p147<=p367)") | XF"(p480>p106)")
Detected timeout of ITS tools.
[2022-05-20 22:43:29] [INFO ] Flatten gal took : 47 ms
[2022-05-20 22:43:29] [INFO ] Applying decomposition
[2022-05-20 22:43:29] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10530804414867827332.txt' '-o' '/tmp/graph10530804414867827332.bin' '-w' '/tmp/graph10530804414867827332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10530804414867827332.bin' '-l' '-1' '-v' '-w' '/tmp/graph10530804414867827332.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:43:30] [INFO ] Decomposing Gal with order
[2022-05-20 22:43:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:43:30] [INFO ] Flatten gal took : 82 ms
[2022-05-20 22:43:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 22:43:30] [INFO ] Time to serialize gal into /tmp/LTL17248383627735498208.gal : 7 ms
[2022-05-20 22:43:30] [INFO ] Time to serialize properties into /tmp/LTL6456459968291113058.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17248383627735498208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6456459968291113058.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1724838...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G((("(gu233.p284<=gu233.p480)")U(X("(gu73.p147<=gu73.p367)")))||(X(F(F("(gu233.p480>gu233.p106)")))))))))
Formula 0 simplified : !XFG(("(gu233.p284<=gu233.p480)" U X"(gu73.p147<=gu73.p367)") | XF"(gu233.p480>gu233.p106)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13242066775741792718
[2022-05-20 22:43:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13242066775741792718
Running compilation step : cd /tmp/ltsmin13242066775741792718;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin13242066775741792718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13242066775741792718;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>([]((((LTLAPp0==true) U 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-100100-LTLCardinality-02 finished in 92977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(p0))))))'
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 296 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 5 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 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 393 place count 110 transition count 108
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 486 place count 110 transition count 15
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 579 place count 17 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 579 place count 17 transition count 12
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 585 place count 14 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 587 place count 13 transition count 11
Applied a total of 587 rules in 41 ms. Remains 13 /504 variables (removed 491) and now considering 11/403 (removed 392) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:44:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:44:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:44:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:44:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:44:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:44:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-20 22:44:00] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:44:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:44:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 11/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/504 places, 11/403 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s9 s12) (GT 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-04 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(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 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:00] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:01] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:01] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:01] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:01] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:01] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:01] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:01] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s130), p1:(LEQ s372 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 733 ms.
Product exploration explored 100000 steps with 50000 reset in 666 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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-100100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100100-LTLCardinality-06 finished in 2770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p0)||F(p1)))&&X(p2))))'
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 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:03] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:03] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:03] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:04] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:04] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:04] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:04] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:44:04] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s126 s46), p0:(GT 1 s368), p1:(GT 1 s141)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 2059 ms.
Stack based approach found an accepted trace after 911 steps with 1 reset with depth 851 and stack size 849 in 12 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-07 finished in 3442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))||G(p0)||p1))))'
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 297 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 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 396 place count 108 transition count 107
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 490 place count 108 transition count 13
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 585 place count 14 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 586 place count 13 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 586 place count 13 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 588 place count 12 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 590 place count 11 transition count 10
Applied a total of 590 rules in 39 ms. Remains 11 /504 variables (removed 493) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-20 22:44:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:44:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-20 22:44:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:44:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-20 22:44:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:44:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-20 22:44:07] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-20 22:44:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:44:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/504 places, 10/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s8), p1:(LEQ s6 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1077 steps with 0 reset in 6 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-08 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U (X(F(p2))&&p3))))'
Support contains 8 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
[2022-05-20 22:44:07] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:07] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:07] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:44:07] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:07] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:44:08] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:44:08] [INFO ] Computed 202 place invariants in 6 ms
[2022-05-20 22:44:08] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p3 p0), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=p3, acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(AND (LEQ s278 s245) (LEQ s52 s438)), p3:(LEQ s237 s193), p1:(GT s52 s438), p2:(AND (LEQ s52 s438) (LEQ s251 s164))], 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1619 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-11 finished in 3058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 298 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 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 394 place count 108 transition count 106
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 489 place count 108 transition count 11
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 584 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 584 place count 13 transition count 9
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 588 place count 11 transition count 9
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 590 place count 10 transition count 8
Applied a total of 590 rules in 14 ms. Remains 10 /504 variables (removed 494) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:44:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:44:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:44:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:10] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:44:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 22:44:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:44:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:44:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/504 places, 8/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 8/403 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLCardinality-13 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((p0 U X(p1))||X(F(F(p2))))))))'
Found a SL insensitive property : RefineWMG-PT-100100-LTLCardinality-02
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 1 with 88 rules applied. Total rules applied 480 place count 112 transition count 22
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 89 rules applied. Total rules applied 569 place count 24 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 570 place count 23 transition count 21
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 570 place count 23 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 580 place count 18 transition count 16
Applied a total of 580 rules in 19 ms. Remains 18 /504 variables (removed 486) and now considering 16/403 (removed 387) transitions.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:44:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:44:10] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:44:10] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:44:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 18/504 places, 16/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/504 places, 16/403 transitions.
Running random walk in product with property : RefineWMG-PT-100100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT s17 s5), p0:(LEQ s10 s17), p1:(LEQ s7 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 176 ms.
Product exploration explored 100000 steps with 5 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 479 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1566 steps, including 0 resets, run visited all 6 properties in 11 ms. (steps per millisecond=142 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 552 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:44:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 22:44:13] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:44:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 22:44:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 22:44:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 451 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1576 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=394 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 632 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 135 ms.
Product exploration explored 100000 steps with 11 reset in 287 ms.
Built C files in :
/tmp/ltsmin17482458238025373328
[2022-05-20 22:44:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17482458238025373328
Running compilation step : cd /tmp/ltsmin17482458238025373328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin17482458238025373328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17482458238025373328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16153537958896004767.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
Treatment of property RefineWMG-PT-100100-LTLCardinality-02 finished in 5536 ms.
FORMULA RefineWMG-PT-100100-LTLCardinality-02 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-20 22:44:16] [INFO ] Flatten gal took : 25 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 120098 ms.
BK_STOP 1653086656171
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-100100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-100100, 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 r186-tajo-165281572400571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 ;