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.r485-tall-167912699100220.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 itstools
Input is Sudoku-PT-AN08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699100220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 218K Feb 26 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 373K Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 08:47 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 109K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 378K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 227K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 809K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 374K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 707K Feb 26 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K 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-PT-AN08-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679185848490

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 00:30:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:30:50] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-19 00:30:50] [INFO ] Transformed 704 places.
[2023-03-19 00:30:50] [INFO ] Transformed 512 transitions.
[2023-03-19 00:30:50] [INFO ] Parsed PT model containing 704 places and 512 transitions and 2048 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 26 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2023-03-19 00:30:50] [INFO ] Computed 23 place invariants in 47 ms
[2023-03-19 00:30:50] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-19 00:30:50] [INFO ] Invariant cache hit.
[2023-03-19 00:30:51] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-19 00:30:51] [INFO ] Invariant cache hit.
[2023-03-19 00:30:51] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 192/704 places, 512/512 transitions.
Support contains 192 out of 192 places after structural reductions.
[2023-03-19 00:30:51] [INFO ] Flatten gal took : 101 ms
[2023-03-19 00:30:51] [INFO ] Flatten gal took : 76 ms
[2023-03-19 00:30:52] [INFO ] Input system was already deterministic with 512 transitions.
Finished random walk after 57 steps, including 0 resets, run visited all 18 properties in 20 ms. (steps per millisecond=2 )
FORMULA Sudoku-PT-AN08-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN08-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:30:52] [INFO ] Invariant cache hit.
[2023-03-19 00:30:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 00:30:52] [INFO ] Invariant cache hit.
[2023-03-19 00:30:52] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 00:30:52] [INFO ] Invariant cache hit.
[2023-03-19 00:30:53] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4681 ms.
Product exploration explored 100000 steps with 50000 reset in 4612 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 96 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-PT-AN08-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLFireability-04 finished in 10846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:03] [INFO ] Invariant cache hit.
[2023-03-19 00:31:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 00:31:03] [INFO ] Invariant cache hit.
[2023-03-19 00:31:03] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-19 00:31:03] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-19 00:31:03] [INFO ] Invariant cache hit.
[2023-03-19 00:31:03] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1799 reset in 3031 ms.
Product exploration explored 100000 steps with 1797 reset in 3094 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN08-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLFireability-05 finished in 7609 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((G(F(p0))||p1))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:11] [INFO ] Invariant cache hit.
[2023-03-19 00:31:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 00:31:11] [INFO ] Invariant cache hit.
[2023-03-19 00:31:11] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-19 00:31:11] [INFO ] Invariant cache hit.
[2023-03-19 00:31:11] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4592 ms.
Product exploration explored 100000 steps with 50000 reset in 4635 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 547 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLFireability-07 finished in 11210 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(!p1)||G(!p2)))&&p0)))'
Support contains 12 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 37 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:22] [INFO ] Invariant cache hit.
[2023-03-19 00:31:22] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-19 00:31:22] [INFO ] Invariant cache hit.
[2023-03-19 00:31:22] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-19 00:31:22] [INFO ] Invariant cache hit.
[2023-03-19 00:31:23] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, p1, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2)]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s30 1) (GEQ s94 1) (GEQ s182 1)) (AND (GEQ s53 1) (GEQ s114 1) (GEQ s149 1))), p0:(AND (GEQ s51 1) (GEQ s115 1) (GEQ s155 1) (OR (LT s0 1...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-08 finished in 871 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' '!((p0 U X(X(!(!p1 U (X(p0) U X(p2)))))))'
Support contains 9 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:23] [INFO ] Invariant cache hit.
[2023-03-19 00:31:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-19 00:31:23] [INFO ] Invariant cache hit.
[2023-03-19 00:31:23] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-19 00:31:23] [INFO ] Invariant cache hit.
[2023-03-19 00:31:23] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 447 ms :[p2, p2, p2, p2, p2, true, p2, p2, p2, p2, p2]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={0, 1} source=7 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 3}, { cond=(OR p0 p2), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 p2)), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=10 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 10}, { cond=(AND p0 p2), acceptance={0, 1} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s77 1) (GEQ s171 1)), p1:(AND (GEQ s54 1) (GEQ s112 1) (GEQ s134 1)), p2:(AND (GEQ s33 1) (GEQ s97 1) (GEQ s137 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 128 steps with 4 reset in 11 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-09 finished in 1147 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' '!((p0 U (!p1||X(((X(G(p0))&&F(p2)) U (!p1&&X(G(p0))&&F(p2)))))))'
Support contains 9 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:24] [INFO ] Invariant cache hit.
[2023-03-19 00:31:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 00:31:24] [INFO ] Invariant cache hit.
[2023-03-19 00:31:24] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-19 00:31:24] [INFO ] Invariant cache hit.
[2023-03-19 00:31:25] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, (OR (NOT p2) (NOT p0) p1), (NOT p0), (NOT p2), true]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s59 1) (GEQ s125 1) (GEQ s171 1)), p0:(AND (GEQ s40 1) (GEQ s107 1) (GEQ s152 1)), p2:(OR (AND (GEQ s40 1) (GEQ s107 1) (GEQ s152 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-10 finished in 862 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((p1&&F(p2)))&&p0)))'
Support contains 9 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:25] [INFO ] Invariant cache hit.
[2023-03-19 00:31:25] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-19 00:31:25] [INFO ] Invariant cache hit.
[2023-03-19 00:31:25] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-19 00:31:25] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 00:31:25] [INFO ] Invariant cache hit.
[2023-03-19 00:31:25] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s67 1) (GEQ s154 1) (GEQ s11 1) (GEQ s72 1) (GEQ s131 1)), p1:(OR (LT s33 1) (LT s96 1) (LT s129 1)), p2:(OR (LT s11 1) (LT s72 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-12 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (!p1 U (p2||G(!p1)))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:26] [INFO ] Invariant cache hit.
[2023-03-19 00:31:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-19 00:31:26] [INFO ] Invariant cache hit.
[2023-03-19 00:31:26] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-19 00:31:26] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 00:31:26] [INFO ] Invariant cache hit.
[2023-03-19 00:31:26] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND p1 (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s59 1) (GEQ s120 1) (GEQ s131 1))) (NOT (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)))), p1:(AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-13 finished in 803 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 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2023-03-19 00:31:26] [INFO ] Invariant cache hit.
[2023-03-19 00:31:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-19 00:31:27] [INFO ] Invariant cache hit.
[2023-03-19 00:31:27] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-19 00:31:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:31:27] [INFO ] Invariant cache hit.
[2023-03-19 00:31:27] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s67 1) (GEQ s154 1))], 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 53 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLFireability-15 finished in 707 ms.
All properties solved by simple procedures.
Total runtime 37644 ms.

BK_STOP 1679185890372

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-AN08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699100220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN08.tgz
mv Sudoku-PT-AN08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;