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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 10:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 10:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 12 10:07 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 14K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 59K Apr 12 10:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 382K Apr 12 10:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 10:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 463K Apr 12 10:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 21K 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-AN03-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717145097038

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-AN03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 08:44:58] [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:44:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:44:58] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-31 08:44:58] [INFO ] Transformed 54 places.
[2024-05-31 08:44:58] [INFO ] Transformed 27 transitions.
[2024-05-31 08:44:58] [INFO ] Found NUPN structural information;
[2024-05-31 08:44:58] [INFO ] Parsed PT model containing 54 places and 27 transitions and 108 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2024-05-31 08:44:58] [INFO ] Computed 27 invariants in 7 ms
[2024-05-31 08:44:59] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-31 08:44:59] [INFO ] Invariant cache hit.
[2024-05-31 08:44:59] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-05-31 08:44:59] [INFO ] Invariant cache hit.
[2024-05-31 08:44:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2024-05-31 08:44:59] [INFO ] Flatten gal took : 21 ms
[2024-05-31 08:44:59] [INFO ] Flatten gal took : 7 ms
[2024-05-31 08:44:59] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 10000 steps, including 1180 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 08:44:59] [INFO ] Invariant cache hit.
[2024-05-31 08:44:59] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 08:44:59] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-05-31 08:44:59] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 54/54 places, 27/27 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 219 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-01 finished in 423 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)))'
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-31 08:45:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:00] [INFO ] Invariant cache hit.
[2024-05-31 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-02 automaton TGBA Formula[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:(LEQ (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53) (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 ...], 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 16446 reset in 416 ms.
Product exploration explored 100000 steps with 16444 reset in 355 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-05-31 08:45:02] [INFO ] Invariant cache hit.
[2024-05-31 08:45:02] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-05-31 08:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 08:45:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:45:02] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2024-05-31 08:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:02] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 08:45:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 08:45:02] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 08:45:02] [INFO ] Invariant cache hit.
[2024-05-31 08:45:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 08:45:02] [INFO ] Invariant cache hit.
[2024-05-31 08:45:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 08:45:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 08:45:02] [INFO ] Invariant cache hit.
[2024-05-31 08:45:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-31 08:45:03] [INFO ] Invariant cache hit.
[2024-05-31 08:45:03] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2024-05-31 08:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:03] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 08:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:45:03] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2024-05-31 08:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:45:03] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 08:45:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 08:45:03] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16452 reset in 339 ms.
Product exploration explored 100000 steps with 16465 reset in 325 ms.
Built C files in :
/tmp/ltsmin3820963582001333978
[2024-05-31 08:45:03] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-31 08:45:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:45:03] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-31 08:45:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:45:03] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-31 08:45:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:45:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3820963582001333978
Running compilation step : cd /tmp/ltsmin3820963582001333978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin3820963582001333978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3820963582001333978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17198679774259085224.hoa' '--buchi-type=spotba'
LTSmin run took 430 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-PT-AN03-LTLCardinality-02 finished in 4223 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((X(p0) U (X(G(p0))||(!p1&&X((p0&&F(G(!p1)))))))))'
Support contains 9 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 08:45:04] [INFO ] Invariant cache hit.
[2024-05-31 08:45:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 08:45:04] [INFO ] Invariant cache hit.
[2024-05-31 08:45:04] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-31 08:45:04] [INFO ] Invariant cache hit.
[2024-05-31 08:45:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-05 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:(GT 1 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-05 finished in 260 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&&G(p1)))))'
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 08:45:04] [INFO ] Invariant cache hit.
[2024-05-31 08:45:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 08:45:04] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s45 s46 s47 s48 s49 s50 s51 ...], 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 5 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-07 finished in 323 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))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-05-31 08:45:05] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-31 08:45:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-10 finished in 169 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(p0)||F(G(p1))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2024-05-31 08:45:05] [INFO ] Computed 8 invariants in 4 ms
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 08:45:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 0) (EQ s4 1)), p1:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-13 finished in 284 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)))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-05-31 08:45:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-31 08:45:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 08:45:05] [INFO ] Invariant cache hit.
[2024-05-31 08:45:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-14 automaton TGBA Formula[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:(AND (NEQ s9 0) (NEQ s27 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-14 finished in 229 ms.
All properties solved by simple procedures.
Total runtime 7483 ms.

BK_STOP 1717145107230

--------------------
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-AN03"
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-AN03, 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-171690556300367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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