Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702600107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-AN14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702600107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679166138963

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:02:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 19:02:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:02:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 19:02:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:02:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 378 ms
[2023-03-18 19:02:20] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:02:21] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 19:02:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN14-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10097 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=296 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=917 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=917 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=1121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=504 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=1682 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 19:02:21] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 19:02:21] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 19:02:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 19:02:21] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:02:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-18 19:02:21] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:02:21] [INFO ] Flatten gal took : 2 ms
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2023-03-18 19:02:21] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 47 ms.
[2023-03-18 19:02:21] [INFO ] Unfolded 8 HLPN properties in 2 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 34 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 19:02:21] [INFO ] Computed 588 place invariants in 37 ms
[2023-03-18 19:02:22] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-18 19:02:22] [INFO ] Invariant cache hit.
[2023-03-18 19:02:24] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
[2023-03-18 19:02:24] [INFO ] Invariant cache hit.
[2023-03-18 19:02:25] [INFO ] Dead Transitions using invariants and state equation in 1803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4229 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2023-03-18 19:02:26] [INFO ] Flatten gal took : 266 ms
[2023-03-18 19:02:26] [INFO ] Flatten gal took : 167 ms
[2023-03-18 19:02:27] [INFO ] Input system was already deterministic with 2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 2550 ms. (steps per millisecond=3 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 19:02:31] [INFO ] Invariant cache hit.
[2023-03-18 19:02:32] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 19:02:33] [INFO ] [Nat]Absence check using 588 positive place invariants in 165 ms returned sat
[2023-03-18 19:02:57] [INFO ] After 13251ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-18 19:02:57] [INFO ] After 13259ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 19:02:57] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.7 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 62 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 588/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 2247 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Probabilistic random walk after 186076 steps, saw 185985 distinct states, run finished after 9009 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 19:03:09] [INFO ] Computed 41 place invariants in 217 ms
[2023-03-18 19:03:10] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-18 19:03:15] [INFO ] After 5591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 19:03:15] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 30 ms returned sat
[2023-03-18 19:03:20] [INFO ] After 4572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 19:03:20] [INFO ] After 5105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-18 19:03:21] [INFO ] After 5612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 6 properties in 27 ms. (steps per millisecond=7 )
Parikh walk visited 6 properties in 30 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 20 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:03:21] [INFO ] Invariant cache hit.
[2023-03-18 19:03:21] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 19:03:21] [INFO ] Invariant cache hit.
[2023-03-18 19:03:22] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-18 19:03:22] [INFO ] Invariant cache hit.
[2023-03-18 19:03:22] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1544 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 48 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-01 finished in 1838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 128 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 19:03:23] [INFO ] Computed 588 place invariants in 14 ms
[2023-03-18 19:03:24] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2023-03-18 19:03:24] [INFO ] Invariant cache hit.
[2023-03-18 19:03:28] [INFO ] Implicit Places using invariants and state equation in 3431 ms returned []
Implicit Place search using SMT with State Equation took 4723 ms to find 0 implicit places.
[2023-03-18 19:03:28] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-18 19:03:28] [INFO ] Invariant cache hit.
[2023-03-18 19:03:29] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6754 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s2940 s2941 s2942 s2943 s2944 s2945 s2946 s2947 s2948 s2949 s2950 s2951 s2952 s2953 s2954 s2955 s2956 s2957 s2958 s2959 s2960 s2961 s2962 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 58280 steps with 338 reset in 10001 ms.
Product exploration timeout after 57940 steps with 336 reset in 10002 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1714 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:03:53] [INFO ] Invariant cache hit.
[2023-03-18 19:03:54] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:03:54] [INFO ] [Nat]Absence check using 588 positive place invariants in 145 ms returned sat
[2023-03-18 19:04:19] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1699 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 359753 steps, run timeout after 6001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 359753 steps, saw 285189 distinct states, run finished after 6002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:04:27] [INFO ] Invariant cache hit.
[2023-03-18 19:04:28] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:04:28] [INFO ] [Nat]Absence check using 588 positive place invariants in 153 ms returned sat
[2023-03-18 19:04:53] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 42 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:04:53] [INFO ] Invariant cache hit.
[2023-03-18 19:04:54] [INFO ] Implicit Places using invariants in 1243 ms returned []
[2023-03-18 19:04:54] [INFO ] Invariant cache hit.
[2023-03-18 19:04:55] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2023-03-18 19:04:55] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-18 19:04:55] [INFO ] Invariant cache hit.
[2023-03-18 19:04:57] [INFO ] Dead Transitions using invariants and state equation in 1717 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4098 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:04:57] [INFO ] Invariant cache hit.
[2023-03-18 19:04:58] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:04:58] [INFO ] [Nat]Absence check using 588 positive place invariants in 155 ms returned sat
[2023-03-18 19:08:43] [INFO ] After 225012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:08:43] [INFO ] Invariant cache hit.
[2023-03-18 19:08:44] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2023-03-18 19:08:44] [INFO ] Invariant cache hit.
[2023-03-18 19:08:48] [INFO ] Implicit Places using invariants and state equation in 3451 ms returned []
Implicit Place search using SMT with State Equation took 4701 ms to find 0 implicit places.
[2023-03-18 19:08:48] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-18 19:08:48] [INFO ] Invariant cache hit.
[2023-03-18 19:08:50] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6533 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1778 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:08:53] [INFO ] Invariant cache hit.
[2023-03-18 19:08:54] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:08:54] [INFO ] [Nat]Absence check using 588 positive place invariants in 158 ms returned sat
[2023-03-18 19:09:19] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1728 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 367294 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 367294 steps, saw 286495 distinct states, run finished after 6001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:09:27] [INFO ] Invariant cache hit.
[2023-03-18 19:09:28] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:09:28] [INFO ] [Nat]Absence check using 588 positive place invariants in 153 ms returned sat
[2023-03-18 19:09:53] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:09:53] [INFO ] Invariant cache hit.
[2023-03-18 19:09:54] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2023-03-18 19:09:54] [INFO ] Invariant cache hit.
[2023-03-18 19:09:57] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
[2023-03-18 19:09:58] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-18 19:09:58] [INFO ] Invariant cache hit.
[2023-03-18 19:09:59] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6403 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 19:09:59] [INFO ] Invariant cache hit.
[2023-03-18 19:10:00] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:10:00] [INFO ] [Nat]Absence check using 588 positive place invariants in 161 ms returned sat
[2023-03-18 19:13:45] [INFO ] After 225015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 58510 steps with 339 reset in 10003 ms.
Product exploration timeout after 58170 steps with 337 reset in 10002 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:14:05] [INFO ] Invariant cache hit.
[2023-03-18 19:14:07] [INFO ] Implicit Places using invariants in 1218 ms returned []
[2023-03-18 19:14:07] [INFO ] Invariant cache hit.
[2023-03-18 19:14:10] [INFO ] Implicit Places using invariants and state equation in 3402 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
[2023-03-18 19:14:10] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-18 19:14:10] [INFO ] Invariant cache hit.
[2023-03-18 19:14:12] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6409 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-03 finished in 649440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:14:12] [INFO ] Invariant cache hit.
[2023-03-18 19:14:13] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-18 19:14:13] [INFO ] Invariant cache hit.
[2023-03-18 19:14:17] [INFO ] Implicit Places using invariants and state equation in 3380 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2023-03-18 19:14:17] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-18 19:14:17] [INFO ] Invariant cache hit.
[2023-03-18 19:14:19] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6443 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s...], 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 168 steps with 0 reset in 54 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-07 finished in 6556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G((!p1&&(G(p2)||(p2&&(!p2||F(!p0)))))) U (p0&&G((!p1&&(G(p2)||(p2&&(!p2||F(!p0))))))))))))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:14:19] [INFO ] Invariant cache hit.
[2023-03-18 19:14:20] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-18 19:14:20] [INFO ] Invariant cache hit.
[2023-03-18 19:14:22] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3382 ms to find 0 implicit places.
[2023-03-18 19:14:22] [INFO ] Invariant cache hit.
[2023-03-18 19:14:24] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5072 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 59010 steps with 342 reset in 10002 ms.
Product exploration timeout after 59190 steps with 343 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1828 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:14:48] [INFO ] Invariant cache hit.
[2023-03-18 19:14:49] [INFO ] [Real]Absence check using 588 positive place invariants in 151 ms returned sat
[2023-03-18 19:15:13] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:15:14] [INFO ] [Nat]Absence check using 588 positive place invariants in 154 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:15:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:15:38] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1900 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271343 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 271343 steps, saw 269940 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:15:47] [INFO ] Invariant cache hit.
[2023-03-18 19:15:48] [INFO ] [Real]Absence check using 588 positive place invariants in 154 ms returned sat
[2023-03-18 19:16:13] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:16:13] [INFO ] [Nat]Absence check using 588 positive place invariants in 153 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:16:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:16:38] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 16 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:16:38] [INFO ] Invariant cache hit.
[2023-03-18 19:16:39] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-18 19:16:39] [INFO ] Invariant cache hit.
[2023-03-18 19:16:41] [INFO ] Implicit Places using invariants and state equation in 2552 ms returned []
Implicit Place search using SMT with State Equation took 3359 ms to find 0 implicit places.
[2023-03-18 19:16:41] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-18 19:16:41] [INFO ] Invariant cache hit.
[2023-03-18 19:16:43] [INFO ] Dead Transitions using invariants and state equation in 1681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5134 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 8 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:16:44] [INFO ] Invariant cache hit.
[2023-03-18 19:16:44] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-18 19:16:44] [INFO ] Invariant cache hit.
[2023-03-18 19:16:47] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
[2023-03-18 19:16:47] [INFO ] Invariant cache hit.
[2023-03-18 19:16:49] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5129 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 434 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1891 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:16:53] [INFO ] Invariant cache hit.
[2023-03-18 19:16:54] [INFO ] [Real]Absence check using 588 positive place invariants in 165 ms returned sat
[2023-03-18 19:17:18] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:17:19] [INFO ] [Nat]Absence check using 588 positive place invariants in 150 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:17:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:17:44] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 26 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1889 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271934 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 271934 steps, saw 270090 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:17:52] [INFO ] Invariant cache hit.
[2023-03-18 19:17:53] [INFO ] [Real]Absence check using 588 positive place invariants in 158 ms returned sat
[2023-03-18 19:18:18] [INFO ] After 25013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:18:18] [INFO ] [Nat]Absence check using 588 positive place invariants in 155 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:18:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:18:43] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 24 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:18:43] [INFO ] Invariant cache hit.
[2023-03-18 19:18:43] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-18 19:18:44] [INFO ] Invariant cache hit.
[2023-03-18 19:18:46] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3394 ms to find 0 implicit places.
[2023-03-18 19:18:46] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-18 19:18:46] [INFO ] Invariant cache hit.
[2023-03-18 19:18:48] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5282 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Product exploration timeout after 57260 steps with 332 reset in 10001 ms.
Product exploration timeout after 58110 steps with 337 reset in 10003 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:19:09] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-18 19:19:09] [INFO ] Invariant cache hit.
[2023-03-18 19:19:11] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1831 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 11 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:19:11] [INFO ] Invariant cache hit.
[2023-03-18 19:19:12] [INFO ] Implicit Places using invariants in 795 ms returned []
[2023-03-18 19:19:12] [INFO ] Invariant cache hit.
[2023-03-18 19:19:14] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 3374 ms to find 0 implicit places.
[2023-03-18 19:19:14] [INFO ] Invariant cache hit.
[2023-03-18 19:19:16] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5052 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-08 finished in 297416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.5 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 99 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 19:19:16] [INFO ] Computed 41 place invariants in 144 ms
[2023-03-18 19:19:17] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-18 19:19:17] [INFO ] Invariant cache hit.
[2023-03-18 19:19:19] [INFO ] Implicit Places using invariants and state equation in 2136 ms returned []
Implicit Place search using SMT with State Equation took 2707 ms to find 0 implicit places.
[2023-03-18 19:19:19] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-18 19:19:19] [INFO ] Invariant cache hit.
[2023-03-18 19:19:20] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3645 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 59380 steps with 344 reset in 10003 ms.
Product exploration timeout after 59010 steps with 342 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1649 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Probabilistic random walk after 225271 steps, saw 225148 distinct states, run finished after 3006 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:19:45] [INFO ] Invariant cache hit.
[2023-03-18 19:19:45] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-18 19:19:48] [INFO ] After 2331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:19:48] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-18 19:19:50] [INFO ] After 2312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:19:50] [INFO ] After 2412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-18 19:19:50] [INFO ] After 2597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:19:51] [INFO ] Invariant cache hit.
[2023-03-18 19:19:51] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-18 19:19:51] [INFO ] Invariant cache hit.
[2023-03-18 19:19:53] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
[2023-03-18 19:19:53] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-18 19:19:53] [INFO ] Invariant cache hit.
[2023-03-18 19:19:54] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3402 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1673 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Probabilistic random walk after 230861 steps, saw 230732 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:19:59] [INFO ] Invariant cache hit.
[2023-03-18 19:19:59] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-18 19:20:01] [INFO ] After 2065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:20:01] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-18 19:20:04] [INFO ] After 2263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:20:04] [INFO ] After 2359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 19:20:04] [INFO ] After 2525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 59720 steps with 346 reset in 10001 ms.
Product exploration timeout after 59270 steps with 343 reset in 10003 ms.
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:20:24] [INFO ] Invariant cache hit.
[2023-03-18 19:20:25] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-18 19:20:25] [INFO ] Invariant cache hit.
[2023-03-18 19:20:27] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-18 19:20:27] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-18 19:20:27] [INFO ] Invariant cache hit.
[2023-03-18 19:20:28] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3546 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-12 finished in 71797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 29 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 19:20:28] [INFO ] Computed 588 place invariants in 18 ms
[2023-03-18 19:20:29] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-18 19:20:29] [INFO ] Invariant cache hit.
[2023-03-18 19:20:32] [INFO ] Implicit Places using invariants and state equation in 3231 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
[2023-03-18 19:20:32] [INFO ] Invariant cache hit.
[2023-03-18 19:20:34] [INFO ] Dead Transitions using invariants and state equation in 1706 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6119 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s3136 s3137 s3138 s3139 s3140 s3141 s3142 s3143 s3144 s3145 s3146 s3147 s3148 s3149 s3150 s3151 s3152 s3153 s3154 s3155 s3156 s3157 s3158 s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-14 finished in 6241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1||F(p2))&&p0)))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 15 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:20:34] [INFO ] Invariant cache hit.
[2023-03-18 19:20:35] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-18 19:20:35] [INFO ] Invariant cache hit.
[2023-03-18 19:20:38] [INFO ] Implicit Places using invariants and state equation in 2572 ms returned []
Implicit Place search using SMT with State Equation took 3394 ms to find 0 implicit places.
[2023-03-18 19:20:38] [INFO ] Invariant cache hit.
[2023-03-18 19:20:39] [INFO ] Dead Transitions using invariants and state equation in 1697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5106 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-15 finished in 5274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G((!p1&&(G(p2)||(p2&&(!p2||F(!p0)))))) U (p0&&G((!p1&&(G(p2)||(p2&&(!p2||F(!p0))))))))))))'
Found a Lengthening insensitive property : Sudoku-COL-AN14-LTLCardinality-08
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:20:40] [INFO ] Invariant cache hit.
[2023-03-18 19:20:41] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-18 19:20:41] [INFO ] Invariant cache hit.
[2023-03-18 19:20:43] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3391 ms to find 0 implicit places.
[2023-03-18 19:20:43] [INFO ] Invariant cache hit.
[2023-03-18 19:20:45] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5105 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 58970 steps with 342 reset in 10003 ms.
Product exploration timeout after 56860 steps with 329 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1919 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:21:09] [INFO ] Invariant cache hit.
[2023-03-18 19:21:10] [INFO ] [Real]Absence check using 588 positive place invariants in 154 ms returned sat
[2023-03-18 19:21:35] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:21:35] [INFO ] [Nat]Absence check using 588 positive place invariants in 150 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:22:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:22:00] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1850 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 275023 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 275023 steps, saw 270735 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:22:08] [INFO ] Invariant cache hit.
[2023-03-18 19:22:09] [INFO ] [Real]Absence check using 588 positive place invariants in 150 ms returned sat
[2023-03-18 19:22:34] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:22:34] [INFO ] [Nat]Absence check using 588 positive place invariants in 147 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:22:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:22:59] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:22:59] [INFO ] Invariant cache hit.
[2023-03-18 19:22:59] [INFO ] Implicit Places using invariants in 805 ms returned []
[2023-03-18 19:22:59] [INFO ] Invariant cache hit.
[2023-03-18 19:23:02] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3450 ms to find 0 implicit places.
[2023-03-18 19:23:02] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-18 19:23:02] [INFO ] Invariant cache hit.
[2023-03-18 19:23:04] [INFO ] Dead Transitions using invariants and state equation in 1660 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5208 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 13 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:23:05] [INFO ] Invariant cache hit.
[2023-03-18 19:23:05] [INFO ] Implicit Places using invariants in 803 ms returned []
[2023-03-18 19:23:05] [INFO ] Invariant cache hit.
[2023-03-18 19:23:08] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
[2023-03-18 19:23:08] [INFO ] Invariant cache hit.
[2023-03-18 19:23:10] [INFO ] Dead Transitions using invariants and state equation in 1723 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5104 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1976 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:23:14] [INFO ] Invariant cache hit.
[2023-03-18 19:23:15] [INFO ] [Real]Absence check using 588 positive place invariants in 159 ms returned sat
[2023-03-18 19:23:39] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:23:40] [INFO ] [Nat]Absence check using 588 positive place invariants in 160 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:24:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:24:05] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1892 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 267434 steps, run timeout after 6001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 267434 steps, saw 267237 distinct states, run finished after 6001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:24:13] [INFO ] Invariant cache hit.
[2023-03-18 19:24:14] [INFO ] [Real]Absence check using 588 positive place invariants in 161 ms returned sat
[2023-03-18 19:24:39] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:24:39] [INFO ] [Nat]Absence check using 588 positive place invariants in 159 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:25:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:25:04] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 29 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:25:04] [INFO ] Invariant cache hit.
[2023-03-18 19:25:05] [INFO ] Implicit Places using invariants in 842 ms returned []
[2023-03-18 19:25:05] [INFO ] Invariant cache hit.
[2023-03-18 19:25:07] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 3479 ms to find 0 implicit places.
[2023-03-18 19:25:07] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-18 19:25:07] [INFO ] Invariant cache hit.
[2023-03-18 19:25:09] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5340 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Product exploration timeout after 56790 steps with 329 reset in 10003 ms.
Product exploration timeout after 57450 steps with 333 reset in 10004 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:25:30] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-18 19:25:30] [INFO ] Invariant cache hit.
[2023-03-18 19:25:32] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1782 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:25:32] [INFO ] Invariant cache hit.
[2023-03-18 19:25:33] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-18 19:25:33] [INFO ] Invariant cache hit.
[2023-03-18 19:25:35] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3408 ms to find 0 implicit places.
[2023-03-18 19:25:35] [INFO ] Invariant cache hit.
[2023-03-18 19:25:37] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5089 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-08 finished in 297688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-18 19:25:37] [INFO ] Flatten gal took : 130 ms
[2023-03-18 19:25:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2023-03-18 19:25:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 13 ms.
Total runtime 1397651 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN14
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality

BK_STOP 1679167736777

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 Sudoku-COL-AN14-LTLCardinality-12
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1199 3/32 Sudoku-COL-AN14-LTLCardinality-12 168677 m, 33735 m/sec, 1112904 t fired, .

Time elapsed: 7 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1199 5/32 Sudoku-COL-AN14-LTLCardinality-12 357846 m, 37833 m/sec, 2374165 t fired, .

Time elapsed: 12 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1199 7/32 Sudoku-COL-AN14-LTLCardinality-12 527079 m, 33846 m/sec, 3668288 t fired, .

Time elapsed: 17 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/1199 9/32 Sudoku-COL-AN14-LTLCardinality-12 699644 m, 34513 m/sec, 4940659 t fired, .

Time elapsed: 22 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 24/1199 11/32 Sudoku-COL-AN14-LTLCardinality-12 877584 m, 35588 m/sec, 6190944 t fired, .

Time elapsed: 27 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 29/1199 14/32 Sudoku-COL-AN14-LTLCardinality-12 1057425 m, 35968 m/sec, 7436839 t fired, .

Time elapsed: 32 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 34/1199 16/32 Sudoku-COL-AN14-LTLCardinality-12 1224818 m, 33478 m/sec, 8709496 t fired, .

Time elapsed: 37 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 39/1199 18/32 Sudoku-COL-AN14-LTLCardinality-12 1388893 m, 32815 m/sec, 10009571 t fired, .

Time elapsed: 42 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 44/1199 20/32 Sudoku-COL-AN14-LTLCardinality-12 1557842 m, 33789 m/sec, 11292009 t fired, .

Time elapsed: 47 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 49/1199 22/32 Sudoku-COL-AN14-LTLCardinality-12 1699545 m, 28340 m/sec, 12632788 t fired, .

Time elapsed: 52 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 54/1199 24/32 Sudoku-COL-AN14-LTLCardinality-12 1849369 m, 29964 m/sec, 13968039 t fired, .

Time elapsed: 57 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 59/1199 25/32 Sudoku-COL-AN14-LTLCardinality-12 1968862 m, 23898 m/sec, 15379641 t fired, .

Time elapsed: 62 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 64/1199 28/32 Sudoku-COL-AN14-LTLCardinality-12 2158675 m, 37962 m/sec, 16655058 t fired, .

Time elapsed: 67 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 69/1199 30/32 Sudoku-COL-AN14-LTLCardinality-12 2340264 m, 36317 m/sec, 17904945 t fired, .

Time elapsed: 72 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 74/1199 31/32 Sudoku-COL-AN14-LTLCardinality-12 2491323 m, 30211 m/sec, 19188942 t fired, .

Time elapsed: 77 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for Sudoku-COL-AN14-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 82 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN14-LTLCardinality-08
lola: time limit : 1759 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1759 4/32 Sudoku-COL-AN14-LTLCardinality-08 56980 m, 11396 m/sec, 336500 t fired, .

Time elapsed: 87 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1759 8/32 Sudoku-COL-AN14-LTLCardinality-08 113899 m, 11383 m/sec, 676742 t fired, .

Time elapsed: 92 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1759 11/32 Sudoku-COL-AN14-LTLCardinality-08 159197 m, 9059 m/sec, 1020711 t fired, .

Time elapsed: 97 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1759 14/32 Sudoku-COL-AN14-LTLCardinality-08 213624 m, 10885 m/sec, 1362114 t fired, .

Time elapsed: 102 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1759 18/32 Sudoku-COL-AN14-LTLCardinality-08 270758 m, 11426 m/sec, 1702831 t fired, .

Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1759 20/32 Sudoku-COL-AN14-LTLCardinality-08 317011 m, 9250 m/sec, 2040604 t fired, .

Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1759 23/32 Sudoku-COL-AN14-LTLCardinality-08 358290 m, 8255 m/sec, 2376827 t fired, .

Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1759 26/32 Sudoku-COL-AN14-LTLCardinality-08 400582 m, 8458 m/sec, 2712786 t fired, .

Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1759 29/32 Sudoku-COL-AN14-LTLCardinality-08 448101 m, 9503 m/sec, 3048035 t fired, .

Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1759 32/32 Sudoku-COL-AN14-LTLCardinality-08 498314 m, 10042 m/sec, 3383693 t fired, .

Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-AN14-LTLCardinality-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN14-LTLCardinality-03
lola: time limit : 3463 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3463 4/32 Sudoku-COL-AN14-LTLCardinality-03 54047 m, 10809 m/sec, 312592 t fired, .

Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3463 7/32 Sudoku-COL-AN14-LTLCardinality-03 107431 m, 10676 m/sec, 625447 t fired, .

Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3463 10/32 Sudoku-COL-AN14-LTLCardinality-03 150449 m, 8603 m/sec, 944614 t fired, .

Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3463 13/32 Sudoku-COL-AN14-LTLCardinality-03 197764 m, 9463 m/sec, 1261164 t fired, .

Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3463 16/32 Sudoku-COL-AN14-LTLCardinality-03 249654 m, 10378 m/sec, 1574600 t fired, .

Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3463 19/32 Sudoku-COL-AN14-LTLCardinality-03 296643 m, 9397 m/sec, 1891045 t fired, .

Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3463 22/32 Sudoku-COL-AN14-LTLCardinality-03 335639 m, 7799 m/sec, 2211072 t fired, .

Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3463 24/32 Sudoku-COL-AN14-LTLCardinality-03 378173 m, 8506 m/sec, 2529129 t fired, .

Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3463 27/32 Sudoku-COL-AN14-LTLCardinality-03 422269 m, 8819 m/sec, 2846349 t fired, .

Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3463 30/32 Sudoku-COL-AN14-LTLCardinality-03 466475 m, 8841 m/sec, 3163296 t fired, .

Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3463 32/32 Sudoku-COL-AN14-LTLCardinality-03 508889 m, 8482 m/sec, 3481414 t fired, .

Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for Sudoku-COL-AN14-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN14-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-08: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN14-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN14-LTLCardinality-03: LTL unknown AGGR
Sudoku-COL-AN14-LTLCardinality-08: LTL unknown AGGR
Sudoku-COL-AN14-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 197 secs. Pages in use: 32

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="Sudoku-COL-AN14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-COL-AN14, 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 r487-tall-167912702600107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;