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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 09:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 09:23 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.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 09:49 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-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679162298442

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-AN10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 17:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 17:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:58: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 17:58:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:58:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 375 ms
[2023-03-18 17:58:20] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 17:58:20] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 10 ms.
[2023-03-18 17:58:20] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-13 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 13 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 98 resets, run finished after 72 ms. (steps per millisecond=140 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 39 ms. (steps per millisecond=258 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 34 ms. (steps per millisecond=296 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=373 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 23 ms. (steps per millisecond=439 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 36 ms. (steps per millisecond=280 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 18 ms. (steps per millisecond=560 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 22 ms. (steps per millisecond=458 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=480 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 17:58:21] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-18 17:58:21] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 17:58:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:58:21] [INFO ] After 37ms 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 13 simplifications.
FORMULA Sudoku-COL-AN10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:58:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 17:58:21] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:58:21] [INFO ] Flatten gal took : 1 ms
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2023-03-18 17:58:21] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 24 ms.
[2023-03-18 17:58:21] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-18 17:58:21] [INFO ] Computed 300 place invariants in 24 ms
[2023-03-18 17:58:21] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-18 17:58:21] [INFO ] Invariant cache hit.
[2023-03-18 17:58:22] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-18 17:58:22] [INFO ] Invariant cache hit.
[2023-03-18 17:58:23] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1514 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2023-03-18 17:58:23] [INFO ] Flatten gal took : 111 ms
[2023-03-18 17:58:23] [INFO ] Flatten gal took : 96 ms
[2023-03-18 17:58:23] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1157 ms. (steps per millisecond=8 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 17:58:25] [INFO ] Invariant cache hit.
[2023-03-18 17:58:26] [INFO ] [Real]Absence check using 300 positive place invariants in 56 ms returned sat
[2023-03-18 17:58:26] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 17:58:26] [INFO ] [Nat]Absence check using 300 positive place invariants in 61 ms returned sat
[2023-03-18 17:58:51] [INFO ] After 23215ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-18 17:58:51] [INFO ] After 23219ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 17:58:51] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.5 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 825 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136664 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136664 steps, saw 77947 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1000 rows 300 cols
[2023-03-18 17:58:55] [INFO ] Computed 29 place invariants in 40 ms
[2023-03-18 17:58:55] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 16 ms returned sat
[2023-03-18 17:59:20] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:59:20] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-18 17:59:44] [INFO ] After 23746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 17:59:45] [INFO ] After 24894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-18 17:59:45] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 13 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 39 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 17:59:45] [INFO ] Invariant cache hit.
[2023-03-18 17:59:45] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-18 17:59:45] [INFO ] Invariant cache hit.
[2023-03-18 17:59:46] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-18 17:59:46] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-18 17:59:46] [INFO ] Invariant cache hit.
[2023-03-18 17:59:46] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1177 ms. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 17:59:46] [INFO ] Invariant cache hit.
[2023-03-18 17:59:47] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-18 17:59:56] [INFO ] After 9298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
FORMULA Sudoku-COL-AN10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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((G((F(p0)&&F(p1)))||(F(p0)&&X((F(p1)&&X(F(p2))))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-18 17:59:56] [INFO ] Computed 300 place invariants in 7 ms
[2023-03-18 17:59:56] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-18 17:59:56] [INFO ] Invariant cache hit.
[2023-03-18 17:59:57] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-18 17:59:57] [INFO ] Invariant cache hit.
[2023-03-18 17:59:58] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1625 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 681 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 (ADD s1100 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 64410 steps with 16102 reset in 10001 ms.
Product exploration timeout after 64070 steps with 16017 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 (NOT p2)), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (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 9 factoid took 450 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:00:43] [INFO ] Invariant cache hit.
[2023-03-18 18:00:44] [INFO ] [Real]Absence check using 300 positive place invariants in 58 ms returned sat
[2023-03-18 18:00:44] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p2)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 11 factoid took 342 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLCardinality-02 finished in 48581 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 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 35 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:00:45] [INFO ] Invariant cache hit.
[2023-03-18 18:00:45] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-18 18:00:45] [INFO ] Invariant cache hit.
[2023-03-18 18:00:46] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2023-03-18 18:00:46] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 18:00:46] [INFO ] Invariant cache hit.
[2023-03-18 18:00:47] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1971 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-03 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 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 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 87 steps with 0 reset in 13 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-03 finished in 2042 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 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:00:47] [INFO ] Invariant cache hit.
[2023-03-18 18:00:47] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-18 18:00:47] [INFO ] Invariant cache hit.
[2023-03-18 18:00:48] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2023-03-18 18:00:48] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 18:00:48] [INFO ] Invariant cache hit.
[2023-03-18 18:00:48] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1610 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 81900 steps with 939 reset in 10001 ms.
Product exploration timeout after 81520 steps with 936 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 33 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=6 )
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 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-18 18:01:46] [INFO ] Invariant cache hit.
[2023-03-18 18:01:56] [INFO ] [Real]Absence check using 300 positive place invariants in 164 ms returned sat
[2023-03-18 18:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:01:57] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2023-03-18 18:01:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:02:12] [INFO ] [Nat]Absence check using 300 positive place invariants in 5820 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:02:12] [INFO ] Invariant cache hit.
[2023-03-18 18:02:12] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-18 18:02:12] [INFO ] Invariant cache hit.
[2023-03-18 18:02:13] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-18 18:02:13] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 18:02:13] [INFO ] Invariant cache hit.
[2023-03-18 18:02:14] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 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)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=5 )
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 156 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-18 18:02:51] [INFO ] Invariant cache hit.
[2023-03-18 18:03:01] [INFO ] [Real]Absence check using 300 positive place invariants in 149 ms returned sat
[2023-03-18 18:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:03:02] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-18 18:03:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:03:17] [INFO ] [Nat]Absence check using 300 positive place invariants in 5938 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 81480 steps with 933 reset in 10001 ms.
Product exploration timeout after 81470 steps with 935 reset in 10002 ms.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:03:37] [INFO ] Invariant cache hit.
[2023-03-18 18:03:38] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-18 18:03:38] [INFO ] Invariant cache hit.
[2023-03-18 18:03:38] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2023-03-18 18:03:38] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 18:03:38] [INFO ] Invariant cache hit.
[2023-03-18 18:03:39] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1641 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Treatment of property Sudoku-COL-AN10-LTLCardinality-06 finished in 172518 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(G(p0))&&F(p1))))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:03:39] [INFO ] Invariant cache hit.
[2023-03-18 18:03:40] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-18 18:03:40] [INFO ] Invariant cache hit.
[2023-03-18 18:03:41] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-18 18:03:41] [INFO ] Invariant cache hit.
[2023-03-18 18:03:41] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1837 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 2 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 26 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-07 finished in 2108 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 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:03:41] [INFO ] Invariant cache hit.
[2023-03-18 18:03:42] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-18 18:03:42] [INFO ] Invariant cache hit.
[2023-03-18 18:03:43] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-18 18:03:43] [INFO ] Invariant cache hit.
[2023-03-18 18:03:43] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1788 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 1 (ADD s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1...], 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-AN10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-14 finished in 1880 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(F(p0))))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-18 18:03:43] [INFO ] Invariant cache hit.
[2023-03-18 18:03:44] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-18 18:03:44] [INFO ] Invariant cache hit.
[2023-03-18 18:03:44] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-18 18:03:45] [INFO ] Invariant cache hit.
[2023-03-18 18:03:45] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 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][false, false, false]]
Product exploration timeout after 79440 steps with 26480 reset in 10002 ms.
Product exploration timeout after 78790 steps with 26263 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLCardinality-15 finished in 43650 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 18:04:27] [INFO ] Flatten gal took : 88 ms
[2023-03-18 18:04:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 18:04:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1300 places, 1000 transitions and 4000 arcs took 4 ms.
Total runtime 367389 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

BK_STOP 1679162764216

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 Sudoku-COL-AN10-LTLCardinality-06 174623 m, 34924 m/sec, 826600 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 5/32 Sudoku-COL-AN10-LTLCardinality-06 319349 m, 28945 m/sec, 1691563 t fired, .

Time elapsed: 10 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 6/32 Sudoku-COL-AN10-LTLCardinality-06 464167 m, 28963 m/sec, 2559108 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 8/32 Sudoku-COL-AN10-LTLCardinality-06 623080 m, 31782 m/sec, 3411402 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 10/32 Sudoku-COL-AN10-LTLCardinality-06 781501 m, 31684 m/sec, 4265417 t fired, .

Time elapsed: 25 secs. Pages in use: 10
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 12/32 Sudoku-COL-AN10-LTLCardinality-06 924642 m, 28628 m/sec, 5124681 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 14/32 Sudoku-COL-AN10-LTLCardinality-06 1067802 m, 28632 m/sec, 5984415 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 16/32 Sudoku-COL-AN10-LTLCardinality-06 1211138 m, 28667 m/sec, 6844903 t fired, .

Time elapsed: 40 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 18/32 Sudoku-COL-AN10-LTLCardinality-06 1354538 m, 28680 m/sec, 7706160 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 20/32 Sudoku-COL-AN10-LTLCardinality-06 1497818 m, 28656 m/sec, 8566694 t fired, .

Time elapsed: 50 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 21/32 Sudoku-COL-AN10-LTLCardinality-06 1639586 m, 28353 m/sec, 9430207 t fired, .

Time elapsed: 55 secs. Pages in use: 21
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 23/32 Sudoku-COL-AN10-LTLCardinality-06 1754032 m, 22889 m/sec, 10304817 t fired, .

Time elapsed: 60 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 24/32 Sudoku-COL-AN10-LTLCardinality-06 1880554 m, 25304 m/sec, 11176208 t fired, .

Time elapsed: 65 secs. Pages in use: 24
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 26/32 Sudoku-COL-AN10-LTLCardinality-06 1980050 m, 19899 m/sec, 12060455 t fired, .

Time elapsed: 70 secs. Pages in use: 26
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 27/32 Sudoku-COL-AN10-LTLCardinality-06 2046069 m, 13203 m/sec, 12966830 t fired, .

Time elapsed: 75 secs. Pages in use: 27
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 28/32 Sudoku-COL-AN10-LTLCardinality-06 2193827 m, 29551 m/sec, 13813305 t fired, .

Time elapsed: 80 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 30/32 Sudoku-COL-AN10-LTLCardinality-06 2342615 m, 29757 m/sec, 14652568 t fired, .

Time elapsed: 85 secs. Pages in use: 30
# 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-AN10-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3600 32/32 Sudoku-COL-AN10-LTLCardinality-06 2481830 m, 27843 m/sec, 15502470 t fired, .

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

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

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

Time elapsed: 95 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-AN10-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 95 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-AN10"
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-AN10, 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-167912702600075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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