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.r489-tall-167912706300115.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 ltsminxred
Input is Sudoku-COL-AN15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 08:56 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.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679191848919

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 02:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 02:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:10:50] [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-19 02:10:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 02:10:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 372 ms
[2023-03-19 02:10:50] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 02:10:51] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-19 02:10:51] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10214 steps, including 44 resets, run finished after 29 ms. (steps per millisecond=352 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=1021 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=1134 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=1459 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=1702 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 02:10:51] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 02:10:51] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 02:10:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 02:10:51] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN15-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 02:10:51] [INFO ] Flatten gal took : 11 ms
[2023-03-19 02:10:51] [INFO ] Flatten gal took : 1 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2023-03-19 02:10:51] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 52 ms.
[2023-03-19 02:10:51] [INFO ] Unfolded 11 HLPN properties in 4 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 39 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 02:10:51] [INFO ] Computed 675 place invariants in 58 ms
[2023-03-19 02:10:52] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-19 02:10:52] [INFO ] Invariant cache hit.
[2023-03-19 02:10:53] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
[2023-03-19 02:10:53] [INFO ] Invariant cache hit.
[2023-03-19 02:10:55] [INFO ] Dead Transitions using invariants and state equation in 2151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3534 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2023-03-19 02:10:55] [INFO ] Flatten gal took : 325 ms
[2023-03-19 02:10:56] [INFO ] Flatten gal took : 275 ms
[2023-03-19 02:10:56] [INFO ] Input system was already deterministic with 3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3544 ms. (steps per millisecond=2 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 02:11:03] [INFO ] Invariant cache hit.
[2023-03-19 02:11:05] [INFO ] After 1142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 02:11:06] [INFO ] [Nat]Absence check using 675 positive place invariants in 210 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 02:11:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 02:11:30] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.8 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 73 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 675/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3220 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Probabilistic random walk after 143572 steps, saw 143522 distinct states, run finished after 15040 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 02:11:51] [INFO ] Computed 44 place invariants in 196 ms
[2023-03-19 02:11:52] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 44 ms returned sat
[2023-03-19 02:11:52] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 02:11:52] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 43 ms returned sat
[2023-03-19 02:11:55] [INFO ] After 3248ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-19 02:11:56] [INFO ] After 4143ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-19 02:11:57] [INFO ] After 4970ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 225 steps, including 0 resets, run visited all 8 properties in 27 ms. (steps per millisecond=8 )
Parikh walk visited 8 properties in 29 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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((G(p0)||G(F(p1)))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 144 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 02:11:57] [INFO ] Computed 675 place invariants in 23 ms
[2023-03-19 02:11:58] [INFO ] Implicit Places using invariants in 989 ms returned []
[2023-03-19 02:11:58] [INFO ] Invariant cache hit.
[2023-03-19 02:12:00] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2023-03-19 02:12:00] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-19 02:12:00] [INFO ] Invariant cache hit.
[2023-03-19 02:12:02] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4684 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s...], 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 197 steps with 0 reset in 91 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-03 finished in 5041 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(X(X(X(F((p0&&X(p1)))))))))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 154 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 02:12:02] [INFO ] Computed 44 place invariants in 119 ms
[2023-03-19 02:12:03] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-19 02:12:03] [INFO ] Invariant cache hit.
[2023-03-19 02:12:10] [INFO ] Implicit Places using invariants and state equation in 6603 ms returned []
Implicit Place search using SMT with State Equation took 7278 ms to find 0 implicit places.
[2023-03-19 02:12:10] [INFO ] Invariant cache hit.
[2023-03-19 02:12:11] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8436 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(GT 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 59 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-04 finished in 8789 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 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 77 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:12:11] [INFO ] Invariant cache hit.
[2023-03-19 02:12:12] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-19 02:12:12] [INFO ] Invariant cache hit.
[2023-03-19 02:12:16] [INFO ] Implicit Places using invariants and state equation in 4539 ms returned []
Implicit Place search using SMT with State Equation took 5033 ms to find 0 implicit places.
[2023-03-19 02:12:16] [INFO ] Invariant cache hit.
[2023-03-19 02:12:17] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6090 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 29050 steps with 14525 reset in 10003 ms.
Product exploration timeout after 28670 steps with 14335 reset in 10004 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 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-AN15-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLCardinality-05 finished in 26840 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((p0||X(p1)))&&G(F(!p0))))'
Support contains 450 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 34 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:12:38] [INFO ] Invariant cache hit.
[2023-03-19 02:12:38] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-19 02:12:38] [INFO ] Invariant cache hit.
[2023-03-19 02:12:45] [INFO ] Implicit Places using invariants and state equation in 6645 ms returned []
Implicit Place search using SMT with State Equation took 6972 ms to find 0 implicit places.
[2023-03-19 02:12:45] [INFO ] Invariant cache hit.
[2023-03-19 02:12:46] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8090 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) p0), p0, p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 44 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-06 finished in 8306 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(p0) U ((p1 U p0)||G(p2))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 43 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 02:12:46] [INFO ] Computed 675 place invariants in 15 ms
[2023-03-19 02:12:47] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-19 02:12:47] [INFO ] Invariant cache hit.
[2023-03-19 02:12:48] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2023-03-19 02:12:48] [INFO ] Redundant transitions in 184 ms returned []
[2023-03-19 02:12:48] [INFO ] Invariant cache hit.
[2023-03-19 02:12:50] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3683 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 21960 steps with 10980 reset in 10005 ms.
Product exploration timeout after 21750 steps with 10875 reset in 10003 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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 p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLCardinality-07 finished in 25507 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 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 102 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:13:12] [INFO ] Invariant cache hit.
[2023-03-19 02:13:13] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2023-03-19 02:13:13] [INFO ] Invariant cache hit.
[2023-03-19 02:13:14] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2023-03-19 02:13:14] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-19 02:13:14] [INFO ] Invariant cache hit.
[2023-03-19 02:13:16] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4720 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 ...], 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 198 steps with 0 reset in 75 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-08 finished in 4854 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(p0)&&F(!p0)))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.11 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 02:13:17] [INFO ] Computed 44 place invariants in 76 ms
[2023-03-19 02:13:17] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-19 02:13:17] [INFO ] Invariant cache hit.
[2023-03-19 02:13:26] [INFO ] Implicit Places using invariants and state equation in 9030 ms returned []
Implicit Place search using SMT with State Equation took 9614 ms to find 0 implicit places.
[2023-03-19 02:13:26] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-19 02:13:26] [INFO ] Invariant cache hit.
[2023-03-19 02:13:27] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10774 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 50 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-11 finished in 10977 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)||X(G(p1)))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 44 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 02:13:27] [INFO ] Computed 675 place invariants in 12 ms
[2023-03-19 02:13:28] [INFO ] Implicit Places using invariants in 889 ms returned []
[2023-03-19 02:13:28] [INFO ] Invariant cache hit.
[2023-03-19 02:13:30] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-03-19 02:13:30] [INFO ] Invariant cache hit.
[2023-03-19 02:13:31] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4059 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 15800 steps with 138 reset in 10001 ms.
Product exploration timeout after 15780 steps with 138 reset in 10006 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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 p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 51 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 02:13:57] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 38 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:12] [INFO ] Invariant cache hit.
[2023-03-19 02:14:13] [INFO ] Implicit Places using invariants in 904 ms returned []
[2023-03-19 02:14:13] [INFO ] Invariant cache hit.
[2023-03-19 02:14:14] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2023-03-19 02:14:14] [INFO ] Invariant cache hit.
[2023-03-19 02:14:16] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4079 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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 p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 53 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 02:14:21] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 16010 steps with 140 reset in 10002 ms.
Product exploration timeout after 15880 steps with 139 reset in 10007 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 124 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:57] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-19 02:14:57] [INFO ] Invariant cache hit.
[2023-03-19 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 1960 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2190 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 39 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:59] [INFO ] Invariant cache hit.
[2023-03-19 02:15:00] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-19 02:15:00] [INFO ] Invariant cache hit.
[2023-03-19 02:15:01] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2023-03-19 02:15:01] [INFO ] Invariant cache hit.
[2023-03-19 02:15:03] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4048 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Treatment of property Sudoku-COL-AN15-LTLCardinality-12 finished in 96050 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(F(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 21 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:04] [INFO ] Invariant cache hit.
[2023-03-19 02:15:04] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-19 02:15:04] [INFO ] Invariant cache hit.
[2023-03-19 02:15:05] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2023-03-19 02:15:05] [INFO ] Invariant cache hit.
[2023-03-19 02:15:07] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3515 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 65 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-13 finished in 3757 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||X((p0 U (G(p0)||(p0&&G(p1)))))))))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 79 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 02:15:07] [INFO ] Computed 44 place invariants in 81 ms
[2023-03-19 02:15:08] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-19 02:15:08] [INFO ] Invariant cache hit.
[2023-03-19 02:15:15] [INFO ] Implicit Places using invariants and state equation in 6711 ms returned []
Implicit Place search using SMT with State Equation took 7290 ms to find 0 implicit places.
[2023-03-19 02:15:15] [INFO ] Invariant cache hit.
[2023-03-19 02:15:16] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8347 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-14 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 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 49 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-14 finished in 8473 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 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 86 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-19 02:15:16] [INFO ] Computed 675 place invariants in 16 ms
[2023-03-19 02:15:17] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-19 02:15:17] [INFO ] Invariant cache hit.
[2023-03-19 02:15:18] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 2584 ms to find 0 implicit places.
[2023-03-19 02:15:18] [INFO ] Invariant cache hit.
[2023-03-19 02:15:20] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4638 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-15 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 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], 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 timeout after 21310 steps with 7103 reset in 10004 ms.
Product exploration timeout after 21280 steps with 7093 reset in 10003 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
[2023-03-19 02:15:44] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 67 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:59] [INFO ] Invariant cache hit.
[2023-03-19 02:16:00] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-19 02:16:00] [INFO ] Invariant cache hit.
[2023-03-19 02:16:01] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
[2023-03-19 02:16:01] [INFO ] Invariant cache hit.
[2023-03-19 02:16:03] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4505 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
[2023-03-19 02:16:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 21150 steps with 7050 reset in 10003 ms.
Product exploration timeout after 21090 steps with 7030 reset in 10004 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 87 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:16:42] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-19 02:16:42] [INFO ] Invariant cache hit.
[2023-03-19 02:16:44] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2142 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 70 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:16:44] [INFO ] Invariant cache hit.
[2023-03-19 02:16:45] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2023-03-19 02:16:45] [INFO ] Invariant cache hit.
[2023-03-19 02:16:46] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2583 ms to find 0 implicit places.
[2023-03-19 02:16:46] [INFO ] Invariant cache hit.
[2023-03-19 02:16:48] [INFO ] Dead Transitions using invariants and state equation in 1974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4641 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Treatment of property Sudoku-COL-AN15-LTLCardinality-15 finished in 92652 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)||X(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
[2023-03-19 02:16:49] [INFO ] Flatten gal took : 221 ms
[2023-03-19 02:16:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-19 02:16:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 17 ms.
Total runtime 359060 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1327/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 15939752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16072828 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1327/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15927420 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062836 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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-AN15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN15, 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 r489-tall-167912706300115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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