About the Execution of ITS-Tools for Sudoku-PT-BN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11078.191 | 3600000.00 | 4040642.00 | 35244.30 | TFTF?FFTTFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545600339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 36K Apr 30 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Apr 30 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Apr 30 12:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 454K Apr 30 12:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 20K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 111K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 53K May 10 09:34 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-BN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653119107242
Running Version 202205111006
[2022-05-21 07:45:08] [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]
[2022-05-21 07:45:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:45:08] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-21 07:45:08] [INFO ] Transformed 128 places.
[2022-05-21 07:45:08] [INFO ] Transformed 64 transitions.
[2022-05-21 07:45:08] [INFO ] Parsed PT model containing 128 places and 64 transitions in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 17 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:08] [INFO ] Computed 64 place invariants in 7 ms
[2022-05-21 07:45:08] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:08] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-21 07:45:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:09] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:09] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2022-05-21 07:45:09] [INFO ] Flatten gal took : 34 ms
[2022-05-21 07:45:09] [INFO ] Flatten gal took : 15 ms
[2022-05-21 07:45:09] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 717 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 26) seen :16
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:10] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-21 07:45:10] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-21 07:45:10] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2022-05-21 07:45:10] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-BN04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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).
FORMULA Sudoku-PT-BN04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U (true U X(p1)))))'
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 07:45:10] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-21 07:45:10] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:10] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-21 07:45:11] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:11] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:11] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 2 (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...], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 934 ms.
Product exploration explored 100000 steps with 33333 reset in 801 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 : [(NOT p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-BN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-00 finished in 2529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((true U G(F(!(true U (false U true)))))))'
Support contains 0 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 0 are kept as prefixes of interest. Removing 128 places using SCC suffix rule.2 ms
Discarding 128 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 8 ms. Remains 0 /128 variables (removed 128) and now considering 0/64 (removed 64) transitions.
[2022-05-21 07:45:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 07:45:13] [INFO ] Implicit Places using invariants in 5 ms returned []
[2022-05-21 07:45:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 07:45:13] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2022-05-21 07:45:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 07:45:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 07:45:13] [INFO ] Dead Transitions using invariants and state equation in 7 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/128 places, 0/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/128 places, 0/64 transitions.
Stuttering acceptance computed with spot in 10 ms :[true]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-03 finished in 67 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(!p0))) U p1))'
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-21 07:45:13] [INFO ] Computed 64 place invariants in 0 ms
[2022-05-21 07:45:13] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:13] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:13] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-05-21 07:45:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:13] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:13] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), p0]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7203 reset in 820 ms.
Product exploration explored 100000 steps with 7186 reset in 917 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), p0]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), p0]
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:16] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-21 07:45:16] [INFO ] [Real]Absence check using 64 positive place invariants in 13 ms returned sat
[2022-05-21 07:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:45:16] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-21 07:45:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:45:16] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2022-05-21 07:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:45:16] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-21 07:45:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-21 07:45:16] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-21 07:45:16] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:16] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:16] [INFO ] Computed 64 place invariants in 0 ms
[2022-05-21 07:45:16] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-21 07:45:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:16] [INFO ] Computed 64 place invariants in 0 ms
[2022-05-21 07:45:16] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), p0]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), p0]
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:17] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-21 07:45:17] [INFO ] [Real]Absence check using 64 positive place invariants in 12 ms returned sat
[2022-05-21 07:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:45:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-21 07:45:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:45:17] [INFO ] [Nat]Absence check using 64 positive place invariants in 16 ms returned sat
[2022-05-21 07:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:45:17] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-21 07:45:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 07:45:18] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 7184 reset in 779 ms.
Product exploration explored 100000 steps with 7183 reset in 800 ms.
Built C files in :
/tmp/ltsmin2545890560309376236
[2022-05-21 07:45:19] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 07:45:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:19] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 07:45:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:19] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 07:45:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:19] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2545890560309376236
Running compilation step : cd /tmp/ltsmin2545890560309376236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin2545890560309376236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2545890560309376236;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12250387171193194311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
[2022-05-21 07:45:34] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:34] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:34] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-21 07:45:34] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-21 07:45:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 128 cols
[2022-05-21 07:45:34] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-21 07:45:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin17449529528880159704
[2022-05-21 07:45:35] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 07:45:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:35] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 07:45:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:35] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 07:45:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:45:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17449529528880159704
Running compilation step : cd /tmp/ltsmin17449529528880159704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin17449529528880159704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17449529528880159704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15766241038711755141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:45:50] [INFO ] Flatten gal took : 10 ms
[2022-05-21 07:45:50] [INFO ] Flatten gal took : 8 ms
[2022-05-21 07:45:50] [INFO ] Time to serialize gal into /tmp/LTL17010360694666315419.gal : 2 ms
[2022-05-21 07:45:50] [INFO ] Time to serialize properties into /tmp/LTL15934175077412064257.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17010360694666315419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15934175077412064257.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1701036...268
Read 1 LTL properties
Checking formula 0 : !(((F(G(X(!("((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Colum...2464
Formula 0 simplified : !(FGX!"((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...2454
Detected timeout of ITS tools.
[2022-05-21 07:46:05] [INFO ] Flatten gal took : 8 ms
[2022-05-21 07:46:05] [INFO ] Applying decomposition
[2022-05-21 07:46:05] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1658133414240181822.txt' '-o' '/tmp/graph1658133414240181822.bin' '-w' '/tmp/graph1658133414240181822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1658133414240181822.bin' '-l' '-1' '-v' '-w' '/tmp/graph1658133414240181822.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:46:05] [INFO ] Decomposing Gal with order
[2022-05-21 07:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:46:05] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-21 07:46:05] [INFO ] Flatten gal took : 56 ms
[2022-05-21 07:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-21 07:46:05] [INFO ] Time to serialize gal into /tmp/LTL18325985820318670403.gal : 3 ms
[2022-05-21 07:46:05] [INFO ] Time to serialize properties into /tmp/LTL5899385607017283109.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18325985820318670403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5899385607017283109.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1832598...267
Read 1 LTL properties
Checking formula 0 : !(((F(G(X(!("((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_1_0+gu2.Columns_1_1)+(gu2.Columns...3744
Formula 0 simplified : !(FGX!"((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_1_0+gu2.Columns_1_1)+(gu2.Columns_1_2...3734
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4363706389557268499
[2022-05-21 07:46:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4363706389557268499
Running compilation step : cd /tmp/ltsmin4363706389557268499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin4363706389557268499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4363706389557268499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-BN04-LTLCardinality-04 finished in 82304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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 5 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:35] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-21 07:46:35] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:35] [INFO ] Computed 24 place invariants in 7 ms
[2022-05-21 07:46:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:35] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-21 07:46:35] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-10 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 s61 s28)], 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 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-10 finished in 322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(p0))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 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 65 transition count 64
Applied a total of 63 rules in 8 ms. Remains 65 /128 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 65 cols
[2022-05-21 07:46:35] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 64 rows 65 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 65 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-21 07:46:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/128 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, true]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s16 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-11 finished in 389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 12 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 2 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-05-21 07:46:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-21 07:46:36] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s38 s11)], 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 15 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-13 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 0 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-21 07:46:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-05-21 07:46:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 64 cols
[2022-05-21 07:46:36] [INFO ] Computed 24 place invariants in 1 ms
[2022-05-21 07:46:36] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s33 s14)], 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 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-15 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(!p0))) U p1))'
[2022-05-21 07:46:37] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
[2022-05-21 07:46:37] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin8787206496926611658
[2022-05-21 07:46:37] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 07:46:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:46:37] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 07:46:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:46:37] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 07:46:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:46:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8787206496926611658
Running compilation step : cd /tmp/ltsmin8787206496926611658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 07:46:37] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4609336579729829195.txt' '-o' '/tmp/graph4609336579729829195.bin' '-w' '/tmp/graph4609336579729829195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4609336579729829195.bin' '-l' '-1' '-v' '-w' '/tmp/graph4609336579729829195.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:46:37] [INFO ] Decomposing Gal with order
[2022-05-21 07:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:46:37] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-21 07:46:37] [INFO ] Flatten gal took : 21 ms
[2022-05-21 07:46:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-21 07:46:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality9528800424698220219.gal : 2 ms
[2022-05-21 07:46:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality5179131980108847789.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9528800424698220219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5179131980108847789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !(((F(G(X(!("((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_1_0+gu2.Columns_1_1)+(gu2.Columns...3744
Formula 0 simplified : !(FGX!"((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_1_0+gu2.Columns_1_1)+(gu2.Columns_1_2...3734
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin8787206496926611658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8787206496926611658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: (<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))
pins2lts-mc-linux64( 2/ 8), 0.001: "(<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.023: State length is 129, there are 70 groups
pins2lts-mc-linux64( 0/ 8), 0.023: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.023: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.023: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.077: [Blue] ~15 levels ~960 states ~5664 transitions
pins2lts-mc-linux64( 2/ 8), 0.088: [Blue] ~15 levels ~1920 states ~8824 transitions
pins2lts-mc-linux64( 2/ 8), 0.134: [Blue] ~15 levels ~3840 states ~16088 transitions
pins2lts-mc-linux64( 2/ 8), 0.201: [Blue] ~17 levels ~7680 states ~30720 transitions
pins2lts-mc-linux64( 2/ 8), 0.319: [Blue] ~17 levels ~15360 states ~68832 transitions
pins2lts-mc-linux64( 2/ 8), 0.488: [Blue] ~17 levels ~30720 states ~150384 transitions
pins2lts-mc-linux64( 5/ 8), 0.763: [Blue] ~15 levels ~61440 states ~287576 transitions
pins2lts-mc-linux64( 3/ 8), 1.215: [Blue] ~15 levels ~122880 states ~595728 transitions
pins2lts-mc-linux64( 3/ 8), 1.975: [Blue] ~15 levels ~245760 states ~1278584 transitions
pins2lts-mc-linux64( 3/ 8), 3.208: [Blue] ~15 levels ~491520 states ~2703912 transitions
pins2lts-mc-linux64( 7/ 8), 5.244: [Blue] ~15 levels ~983040 states ~5766960 transitions
pins2lts-mc-linux64( 6/ 8), 8.602: [Blue] ~17 levels ~1966080 states ~12416744 transitions
pins2lts-mc-linux64( 7/ 8), 15.349: [Blue] ~17 levels ~3932160 states ~25456336 transitions
pins2lts-mc-linux64( 0/ 8), 30.164: [Blue] ~17 levels ~7864320 states ~52191688 transitions
pins2lts-mc-linux64( 7/ 8), 67.841: [Blue] ~17 levels ~15728640 states ~112895120 transitions
pins2lts-mc-linux64( 7/ 8), 78.966: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 79.051:
pins2lts-mc-linux64( 0/ 8), 79.051: Explored 16045287 states 118107495 transitions, fanout: 7.361
pins2lts-mc-linux64( 0/ 8), 79.051: Total exploration time 79.000 sec (78.920 sec minimum, 78.956 sec on average)
pins2lts-mc-linux64( 0/ 8), 79.051: States per second: 203105, Transitions per second: 1495032
pins2lts-mc-linux64( 0/ 8), 79.051:
pins2lts-mc-linux64( 0/ 8), 79.051: State space has 16046108 states, 1237 are accepting
pins2lts-mc-linux64( 0/ 8), 79.051: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 79.051: blue states: 16045287 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 79.051: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 79.051: all-red states: 1237 (0.01%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 79.051:
pins2lts-mc-linux64( 0/ 8), 79.051: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 79.051:
pins2lts-mc-linux64( 0/ 8), 79.051: Queue width: 8B, total height: 136, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 79.051: Tree memory: 378.4MB, 24.7 B/state, compr.: 4.8%
pins2lts-mc-linux64( 0/ 8), 79.051: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 79.051: Stored 80 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 79.051: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 79.051: Est. total memory use: 378.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8787206496926611658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8787206496926611658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](X(!(LTLAPp0==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 186912 deadlock states
Detected timeout of ITS tools.
[2022-05-21 08:07:06] [INFO ] Flatten gal took : 24 ms
[2022-05-21 08:07:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality16988445086537764143.gal : 1 ms
[2022-05-21 08:07:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality17965263175322186868.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16988445086537764143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17965263175322186868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !(((F(G(X(!("((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Colum...2464
Formula 0 simplified : !(FGX!"((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...2454
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 186912 deadlock states
Detected timeout of ITS tools.
[2022-05-21 08:27:35] [INFO ] Flatten gal took : 9 ms
[2022-05-21 08:27:35] [INFO ] Input system was already deterministic with 64 transitions.
[2022-05-21 08:27:35] [INFO ] Transformed 128 places.
[2022-05-21 08:27:35] [INFO ] Transformed 64 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 08:27:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality17134982241821272381.gal : 1 ms
[2022-05-21 08:27:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality17929952863659282121.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17134982241821272381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17929952863659282121.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G(X(!("((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Colum...2464
Formula 0 simplified : !(FGX!"((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...2454
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 186912 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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-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-PT-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 r258-tall-165303545600339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-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 '
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 ;