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-167912702500027.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-AN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702500027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.2K Feb 26 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 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-AN04-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679158621178

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-AN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 16:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 16:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:57:02] [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 16:57:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 16:57:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 739 ms
[2023-03-18 16:57:03] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 16:57:03] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 16:57:03] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN04-LTLCardinality-11 TRUE 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 15 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 10007 steps, including 555 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 16:57:04] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-18 16:57:04] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 16:57:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 16:57:04] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 16:57:04] [INFO ] Flatten gal took : 13 ms
[2023-03-18 16:57:04] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 16:57:04] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 7 ms.
[2023-03-18 16:57:04] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 16:57:04] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-18 16:57:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 16:57:04] [INFO ] Invariant cache hit.
[2023-03-18 16:57:04] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 16:57:04] [INFO ] Invariant cache hit.
[2023-03-18 16:57:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2023-03-18 16:57:04] [INFO ] Flatten gal took : 13 ms
[2023-03-18 16:57:05] [INFO ] Flatten gal took : 10 ms
[2023-03-18 16:57:05] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 696 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 16:57:05] [INFO ] Invariant cache hit.
[2023-03-18 16:57:05] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 16:57:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-18 16:57:05] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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' '!((F(p0) U (X((p1 U p2))||G(p3))))'
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 16:57:05] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-18 16:57:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 16:57:05] [INFO ] Invariant cache hit.
[2023-03-18 16:57:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-18 16:57:05] [INFO ] Invariant cache hit.
[2023-03-18 16:57:05] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)), p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 655 ms.
Product exploration explored 100000 steps with 50000 reset in 646 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 (NOT p3) p0 p2 p1), (X (NOT (AND p3 (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (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 sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) p0 p2 p1)
Knowledge based reduction with 24 factoid took 1560 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-00 finished in 3559 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 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 16:57:09] [INFO ] Computed 48 place invariants in 5 ms
[2023-03-18 16:57:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:09] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-01 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 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s...], 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 9 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-01 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1)&&X(G(p0))))))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 6 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 16:57:09] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 16:57:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p1:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-02 finished in 1422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 16:57:11] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-18 16:57:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 16:57:11] [INFO ] Invariant cache hit.
[2023-03-18 16:57:11] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-18 16:57:11] [INFO ] Invariant cache hit.
[2023-03-18 16:57:11] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 538 ms.
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-04 finished in 1515 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(X(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 3 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 16:57:12] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-18 16:57:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 16:57:12] [INFO ] Invariant cache hit.
[2023-03-18 16:57:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-18 16:57:12] [INFO ] Invariant cache hit.
[2023-03-18 16:57:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 524 ms.
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-06 finished in 1444 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 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 16:57:13] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-18 16:57:14] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:57:14] [INFO ] Invariant cache hit.
[2023-03-18 16:57:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-18 16:57:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:14] [INFO ] Invariant cache hit.
[2023-03-18 16:57:14] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-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 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6941 reset in 700 ms.
Product exploration explored 100000 steps with 6946 reset in 798 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-18 16:57:16] [INFO ] Invariant cache hit.
[2023-03-18 16:57:16] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-18 16:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:16] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-18 16:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-18 16:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:16] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-18 16:57:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 16:57:16] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 16:57:16] [INFO ] Invariant cache hit.
[2023-03-18 16:57:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-18 16:57:16] [INFO ] Invariant cache hit.
[2023-03-18 16:57:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-18 16:57:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:57:16] [INFO ] Invariant cache hit.
[2023-03-18 16:57:16] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-18 16:57:17] [INFO ] Invariant cache hit.
[2023-03-18 16:57:17] [INFO ] [Real]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-18 16:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-18 16:57:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 16:57:17] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-18 16:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 16:57:17] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-18 16:57:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 16:57:17] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6961 reset in 652 ms.
Product exploration explored 100000 steps with 6939 reset in 683 ms.
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 16:57:18] [INFO ] Invariant cache hit.
[2023-03-18 16:57:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 16:57:18] [INFO ] Invariant cache hit.
[2023-03-18 16:57:18] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 16:57:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:18] [INFO ] Invariant cache hit.
[2023-03-18 16:57:18] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 112/112 places, 64/64 transitions.
Treatment of property Sudoku-COL-AN04-LTLCardinality-07 finished in 5001 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((X(p0) U (X(G(p0))||(p1&&X(p0)))))||((X(p0) U (X(G(p0))||(p1&&X(p0))))&&X(F(!p1))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 16:57:18] [INFO ] Invariant cache hit.
[2023-03-18 16:57:19] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 16:57:19] [INFO ] Invariant cache hit.
[2023-03-18 16:57:19] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-18 16:57:19] [INFO ] Invariant cache hit.
[2023-03-18 16:57:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28583 reset in 665 ms.
Product exploration explored 100000 steps with 28598 reset in 685 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 374 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 697 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 16:57:21] [INFO ] Invariant cache hit.
[2023-03-18 16:57:21] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-18 16:57:21] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 10 factoid took 303 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-08 finished in 2948 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)||G((F(!p1)&&F(p2))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 16:57:21] [INFO ] Invariant cache hit.
[2023-03-18 16:57:21] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:57:21] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-18 16:57:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:22] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-10 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 16:57:22] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-18 16:57:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-18 16:57:22] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 16:57:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 16:57:22] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)) (GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-12 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 16:57:22] [INFO ] Computed 48 place invariants in 5 ms
[2023-03-18 16:57:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 16:57:22] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-18 16:57:22] [INFO ] Invariant cache hit.
[2023-03-18 16:57:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], 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]]
Product exploration explored 100000 steps with 50000 reset in 477 ms.
Product exploration explored 100000 steps with 50000 reset in 488 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-13 finished in 1361 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 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 16:57:23] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 16:57:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 16:57:23] [INFO ] Invariant cache hit.
[2023-03-18 16:57:23] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 16:57:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:23] [INFO ] Invariant cache hit.
[2023-03-18 16:57:24] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-14 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 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 2 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-14 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&F(G(p0))))))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2023-03-18 16:57:24] [INFO ] Invariant cache hit.
[2023-03-18 16:57:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-18 16:57:24] [INFO ] Invariant cache hit.
[2023-03-18 16:57:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-18 16:57:24] [INFO ] Invariant cache hit.
[2023-03-18 16:57:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 8 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-15 finished in 335 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)))'
[2023-03-18 16:57:24] [INFO ] Flatten gal took : 9 ms
[2023-03-18 16:57:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-18 16:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 1 ms.
Total runtime 21953 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679158696278

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN04-LTLCardinality-07
lola: time limit : 3600 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-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 Sudoku-COL-AN04-LTLCardinality-07 685592 m, 137118 m/sec, 5536540 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 9/32 Sudoku-COL-AN04-LTLCardinality-07 1282934 m, 119468 m/sec, 10961358 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 13/32 Sudoku-COL-AN04-LTLCardinality-07 1820271 m, 107467 m/sec, 16431813 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 16/32 Sudoku-COL-AN04-LTLCardinality-07 2319027 m, 99751 m/sec, 21687291 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 20/32 Sudoku-COL-AN04-LTLCardinality-07 2810354 m, 98265 m/sec, 26931958 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 23/32 Sudoku-COL-AN04-LTLCardinality-07 3259916 m, 89912 m/sec, 32076702 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 25/32 Sudoku-COL-AN04-LTLCardinality-07 3618557 m, 71728 m/sec, 37073798 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 28/32 Sudoku-COL-AN04-LTLCardinality-07 3978181 m, 71924 m/sec, 42202085 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 32/32 Sudoku-COL-AN04-LTLCardinality-07 4574089 m, 119181 m/sec, 47392633 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN04-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN04-LTLCardinality-07: LTL unknown AGGR


Time elapsed: 50 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-AN04"
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-AN04, 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-167912702500027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 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 ;