Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746100532.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746100532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 15K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 36K May 5 16:52 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-BN04-00
FORMULA_NAME Sudoku-COL-BN04-01
FORMULA_NAME Sudoku-COL-BN04-02
FORMULA_NAME Sudoku-COL-BN04-03
FORMULA_NAME Sudoku-COL-BN04-04
FORMULA_NAME Sudoku-COL-BN04-05
FORMULA_NAME Sudoku-COL-BN04-06
FORMULA_NAME Sudoku-COL-BN04-07
FORMULA_NAME Sudoku-COL-BN04-08
FORMULA_NAME Sudoku-COL-BN04-09
FORMULA_NAME Sudoku-COL-BN04-10
FORMULA_NAME Sudoku-COL-BN04-11
FORMULA_NAME Sudoku-COL-BN04-12
FORMULA_NAME Sudoku-COL-BN04-13
FORMULA_NAME Sudoku-COL-BN04-14
FORMULA_NAME Sudoku-COL-BN04-15

=== Now, execution of the tool begins

BK_START 1621226273895

Running Version 0
[2021-05-17 04:37:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 04:37:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:37:56] [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.
[2021-05-17 04:37:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 04:37:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 565 ms
[2021-05-17 04:37:56] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 128 PT places and 256.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-BN04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:37:56] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions in 3 ms.
[2021-05-17 04:37:56] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_15001077783274600805.dot
[2021-05-17 04:37:56] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 100007 steps, including 5555 resets, run finished after 99 ms. (steps per millisecond=1010 ) properties (out of 20) seen :11
Running SMT prover for 9 properties.
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 04:37:56] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 04:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:37:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 04:37:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:37:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 04:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:37:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 04:37:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 04:37:56] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
[2021-05-17 04:37:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-BN04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:37:57] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 04:37:57] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-BN04-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:37:57] [INFO ] Flatten gal took : 1 ms
[2021-05-17 04:37:57] [INFO ] Unfolded HLPN to a Petri net with 128 places and 64 transitions in 11 ms.
[2021-05-17 04:37:57] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_16742604323239972353.dot
[2021-05-17 04:37:57] [INFO ] Initial state test concluded for 1 properties.
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:57] [INFO ] Computed 64 place invariants in 8 ms
[2021-05-17 04:37:57] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:57] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-17 04:37:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:57] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-17 04:37:57] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
[2021-05-17 04:37:57] [INFO ] Flatten gal took : 20 ms
[2021-05-17 04:37:57] [INFO ] Flatten gal took : 14 ms
[2021-05-17 04:37:57] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 100000 steps, including 7170 resets, run finished after 926 ms. (steps per millisecond=107 ) properties (out of 11) seen :9
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:58] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:37:58] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned unsat
[2021-05-17 04:37:58] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 80 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:58] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-17 04:37:58] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:58] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-17 04:37:58] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2021-05-17 04:37:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:58] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-17 04:37:58] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23127 steps with 2309 reset in 261 ms.
FORMULA Sudoku-COL-BN04-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-01 finished in 753 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:37:59] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:37:59] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2021-05-17 04:37:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:37:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111)) (LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 278 steps with 19 reset in 3 ms.
FORMULA Sudoku-COL-BN04-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-04 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 4 ms
[2021-05-17 04:37:59] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-17 04:37:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 5 ms
[2021-05-17 04:37:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} 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:(AND (LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79) (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111)) (LEQ 2 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-05 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:37:59] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:37:59] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:38:00] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:38:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79)), p0:(GT (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 8 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN04-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-06 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1))||(F(p1)&&X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 32 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 3 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 3 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 2 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 2 ms
[2021-05-17 04:38:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN04-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)), p0:(GT 1 (ADD s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-07 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 64 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 7 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2021-05-17 04:38:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2021-05-17 04:38:00] [INFO ] Computed 24 place invariants in 2 ms
[2021-05-17 04:38:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN04-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63))], 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 16 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-08 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 80 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:38:00] [INFO ] Computed 64 place invariants in 0 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:38:00] [INFO ] Computed 64 place invariants in 0 ms
[2021-05-17 04:38:00] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2021-05-17 04:38:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 04:38:00] [INFO ] Computed 64 place invariants in 1 ms
[2021-05-17 04:38:00] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, p0]
Running random walk in product with property : Sudoku-COL-BN04-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-BN04-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN04-09 finished in 256 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621226281974

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-BN04"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-BN04, 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 r254-tall-162106746100532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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