Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556300372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556300372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 40K Apr 12 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 400K Apr 12 11:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 22K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 305K Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 12 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 667K Apr 12 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:43 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-AN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717145135961

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 08:45:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 08:45:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:45:37] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-31 08:45:37] [INFO ] Transformed 112 places.
[2024-05-31 08:45:37] [INFO ] Transformed 64 transitions.
[2024-05-31 08:45:37] [INFO ] Found NUPN structural information;
[2024-05-31 08:45:37] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-31 08:45:37] [INFO ] Computed 48 invariants in 13 ms
[2024-05-31 08:45:38] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 08:45:38] [INFO ] Invariant cache hit.
[2024-05-31 08:45:38] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-31 08:45:38] [INFO ] Invariant cache hit.
[2024-05-31 08:45:38] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2024-05-31 08:45:38] [INFO ] Flatten gal took : 25 ms
[2024-05-31 08:45:38] [INFO ] Flatten gal took : 18 ms
[2024-05-31 08:45:38] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:45:38] [INFO ] Invariant cache hit.
[2024-05-31 08:45:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 08:45:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2024-05-31 08:45:38] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 08:45:38] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 08:45:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 08:45:39] [INFO ] Invariant cache hit.
[2024-05-31 08:45:39] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 08:45:39] [INFO ] Invariant cache hit.
[2024-05-31 08:45:39] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 48/112 places, 64/64 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 2 reset in 2 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-00 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-31 08:45:39] [INFO ] Computed 48 invariants in 5 ms
[2024-05-31 08:45:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 08:45:39] [INFO ] Invariant cache hit.
[2024-05-31 08:45:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-31 08:45:39] [INFO ] Invariant cache hit.
[2024-05-31 08:45:39] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95)), p2:(GT 2 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s9...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-03 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1||(p0 U (p2||G(p0))))))))'
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:40] [INFO ] Invariant cache hit.
[2024-05-31 08:45:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 08:45:40] [INFO ] Invariant cache hit.
[2024-05-31 08:45:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-31 08:45:40] [INFO ] Invariant cache hit.
[2024-05-31 08:45:40] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), 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 s5...], 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 10000 reset in 882 ms.
Product exploration explored 100000 steps with 10000 reset in 864 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-31 08:45:42] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2024-05-31 08:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:43] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-31 08:45:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:45:43] [INFO ] [Nat]Absence check using 48 positive place invariants in 31 ms returned sat
[2024-05-31 08:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:43] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-05-31 08:45:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 08:45:43] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:43] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 08:45:43] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-31 08:45:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:43] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 363 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-31 08:45:44] [INFO ] Invariant cache hit.
[2024-05-31 08:45:44] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2024-05-31 08:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:44] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-31 08:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:45:44] [INFO ] [Nat]Absence check using 48 positive place invariants in 28 ms returned sat
[2024-05-31 08:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:45] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-31 08:45:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 08:45:45] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 69478 steps with 6947 reset in 560 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-04 finished in 5825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:45] [INFO ] Invariant cache hit.
[2024-05-31 08:45:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 08:45:45] [INFO ] Invariant cache hit.
[2024-05-31 08:45:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-31 08:45:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:46] [INFO ] Invariant cache hit.
[2024-05-31 08:45:46] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT (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 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 37855 steps with 3782 reset in 374 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-06 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(G(p1))))))'
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 3 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 08:45:46] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 08:45:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 08:45:46] [INFO ] Invariant cache hit.
[2024-05-31 08:45:46] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-31 08:45:46] [INFO ] Invariant cache hit.
[2024-05-31 08:45:46] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 485 steps with 33 reset in 8 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-07 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 49 transition count 64
Applied a total of 63 rules in 18 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 49 cols
[2024-05-31 08:45:47] [INFO ] Computed 11 invariants in 3 ms
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 49/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s16 0) (EQ s26 1)), p0:(OR (EQ s26 0) (EQ s16 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-08 finished in 572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0||F(G(p0))))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 3 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 08:45:47] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 226 ms :[false, (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s26 0) (NEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 3 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-09 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 7 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-14 automaton TGBA Formula[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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s26 0) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-14 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 08:45:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s14 0) (NEQ s35 1)), p1:(OR (EQ s33 0) (EQ s22 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 17 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-15 finished in 380 ms.
All properties solved by simple procedures.
Total runtime 11566 ms.

BK_STOP 1717145152472

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-AN04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556300372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;