About the Execution of ITS-Tools for Sudoku-COL-AN16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8141.884 | 3030302.00 | 1891592.00 | 30257.60 | FFT?TTTTT??FFFFT | 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-165303545400163.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-COL-AN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.7K Apr 30 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 11:39 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 3.6K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN16-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653084993702
Running Version 202205111006
[2022-05-20 22:16:34] [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-20 22:16:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:16:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 22:16:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 22:16:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2022-05-20 22:16:35] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 22:16:35] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 7 ms.
[2022-05-20 22:16:35] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10061 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=205 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=838 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=838 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 22:16:35] [INFO ] Computed 3 place invariants in 13 ms
[2022-05-20 22:16:35] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 22:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-20 22:16:35] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-COL-AN16-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 22:16:35] [INFO ] Flatten gal took : 11 ms
[2022-05-20 22:16:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 22:16:35] [INFO ] Flatten gal took : 0 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2022-05-20 22:16:36] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 80 ms.
[2022-05-20 22:16:36] [INFO ] Unfolded 5 HLPN properties in 3 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 47 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:16:36] [INFO ] Computed 768 place invariants in 74 ms
[2022-05-20 22:16:36] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:16:37] [INFO ] Computed 768 place invariants in 28 ms
[2022-05-20 22:16:37] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:16:37] [INFO ] Computed 768 place invariants in 21 ms
[2022-05-20 22:16:40] [INFO ] Dead Transitions using invariants and state equation in 2639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2022-05-20 22:16:40] [INFO ] Flatten gal took : 408 ms
[2022-05-20 22:16:41] [INFO ] Flatten gal took : 271 ms
[2022-05-20 22:16:41] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3743 ms. (steps per millisecond=2 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:16:46] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-20 22:16:47] [INFO ] [Real]Absence check using 768 positive place invariants in 277 ms returned sat
[2022-05-20 22:17:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 22:17:11] [INFO ] After 25052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.11 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 98 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3593 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Probabilistic random walk after 174938 steps, saw 174886 distinct states, run finished after 12072 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:17:28] [INFO ] Computed 47 place invariants in 580 ms
[2022-05-20 22:17:29] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 43 ms returned sat
[2022-05-20 22:17:54] [INFO ] After 24783ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-20 22:17:54] [INFO ] After 24794ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 22:17:54] [INFO ] After 25048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-20 22:17:54] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 38 ms returned sat
[2022-05-20 22:18:01] [INFO ] After 7067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 22:18:01] [INFO ] After 7605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 288 ms.
[2022-05-20 22:18:02] [INFO ] After 8138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 4 properties in 32 ms. (steps per millisecond=8 )
Parikh walk visited 4 properties in 35 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.18 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 197 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:18:03] [INFO ] Computed 47 place invariants in 360 ms
[2022-05-20 22:18:03] [INFO ] Implicit Places using invariants in 940 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:18:03] [INFO ] Computed 47 place invariants in 260 ms
[2022-05-20 22:18:07] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned []
Implicit Place search using SMT with State Equation took 4358 ms to find 0 implicit places.
[2022-05-20 22:18:07] [INFO ] Redundant transitions in 256 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:18:07] [INFO ] Computed 47 place invariants in 271 ms
[2022-05-20 22:18:08] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-03 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 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 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 s36 s...], 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 timeout after 37570 steps with 166 reset in 10002 ms.
Product exploration timeout after 37420 steps with 165 reset in 10003 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 592 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2664 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Probabilistic random walk after 234654 steps, saw 234581 distinct states, run finished after 6011 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:18:39] [INFO ] Computed 47 place invariants in 304 ms
[2022-05-20 22:18:39] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:19:04] [INFO ] After 25014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 81 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2671 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Probabilistic random walk after 236654 steps, saw 236580 distinct states, run finished after 6009 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:19:13] [INFO ] Computed 47 place invariants in 293 ms
[2022-05-20 22:19:14] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:19:39] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 109 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 65 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:19:39] [INFO ] Computed 47 place invariants in 275 ms
[2022-05-20 22:19:40] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:19:40] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-20 22:19:43] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 4629 ms to find 0 implicit places.
[2022-05-20 22:19:44] [INFO ] Redundant transitions in 234 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:19:44] [INFO ] Computed 47 place invariants in 265 ms
[2022-05-20 22:19:45] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:19:45] [INFO ] Computed 47 place invariants in 273 ms
[2022-05-20 22:19:46] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 41 ms returned sat
[2022-05-20 22:23:31] [INFO ] After 225018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 55 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:23:31] [INFO ] Computed 47 place invariants in 255 ms
[2022-05-20 22:23:32] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:23:32] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-20 22:23:35] [INFO ] Implicit Places using invariants and state equation in 3808 ms returned []
Implicit Place search using SMT with State Equation took 4653 ms to find 0 implicit places.
[2022-05-20 22:23:36] [INFO ] Redundant transitions in 160 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:23:36] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-20 22:23:37] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2690 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Probabilistic random walk after 233502 steps, saw 233430 distinct states, run finished after 6022 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:23:47] [INFO ] Computed 47 place invariants in 301 ms
[2022-05-20 22:23:47] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:24:12] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2657 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Probabilistic random walk after 232502 steps, saw 232430 distinct states, run finished after 6009 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:24:22] [INFO ] Computed 47 place invariants in 318 ms
[2022-05-20 22:24:22] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 41 ms returned sat
[2022-05-20 22:24:47] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:24:47] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-20 22:24:48] [INFO ] Implicit Places using invariants in 866 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:24:48] [INFO ] Computed 47 place invariants in 260 ms
[2022-05-20 22:24:52] [INFO ] Implicit Places using invariants and state equation in 3926 ms returned []
Implicit Place search using SMT with State Equation took 4795 ms to find 0 implicit places.
[2022-05-20 22:24:52] [INFO ] Redundant transitions in 165 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:24:52] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-20 22:24:53] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 52 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:24:54] [INFO ] Computed 47 place invariants in 259 ms
[2022-05-20 22:24:54] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 41 ms returned sat
[2022-05-20 22:28:39] [INFO ] After 225028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 37770 steps with 167 reset in 10006 ms.
Product exploration timeout after 37510 steps with 166 reset in 10005 ms.
Built C files in :
/tmp/ltsmin12396147305704451821
[2022-05-20 22:28:59] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 22:28:59] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12396147305704451821
Running compilation step : cd /tmp/ltsmin12396147305704451821;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12396147305704451821;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12396147305704451821;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 53 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:02] [INFO ] Computed 47 place invariants in 282 ms
[2022-05-20 22:29:03] [INFO ] Implicit Places using invariants in 854 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:03] [INFO ] Computed 47 place invariants in 252 ms
[2022-05-20 22:29:07] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
[2022-05-20 22:29:07] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:07] [INFO ] Computed 47 place invariants in 254 ms
[2022-05-20 22:29:08] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin14389439363141417612
[2022-05-20 22:29:08] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 22:29:08] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14389439363141417612
Running compilation step : cd /tmp/ltsmin14389439363141417612;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14389439363141417612;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14389439363141417612;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:29:12] [INFO ] Flatten gal took : 166 ms
[2022-05-20 22:29:12] [INFO ] Flatten gal took : 164 ms
[2022-05-20 22:29:12] [INFO ] Time to serialize gal into /tmp/LTL12905785314975162037.gal : 37 ms
[2022-05-20 22:29:12] [INFO ] Time to serialize properties into /tmp/LTL877147266949248353.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/LTL12905785314975162037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL877147266949248353.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/LTL1290578...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+R...2745
Formula 0 simplified : !FGF"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...2737
Detected timeout of ITS tools.
[2022-05-20 22:29:27] [INFO ] Flatten gal took : 151 ms
[2022-05-20 22:29:27] [INFO ] Applying decomposition
[2022-05-20 22:29:28] [INFO ] Flatten gal took : 143 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/graph6108904134044813149.txt' '-o' '/tmp/graph6108904134044813149.bin' '-w' '/tmp/graph6108904134044813149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6108904134044813149.bin' '-l' '-1' '-v' '-w' '/tmp/graph6108904134044813149.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:29:28] [INFO ] Decomposing Gal with order
[2022-05-20 22:29:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:29:29] [INFO ] Removed a total of 11520 redundant transitions.
[2022-05-20 22:29:29] [INFO ] Flatten gal took : 1191 ms
[2022-05-20 22:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 38 ms.
[2022-05-20 22:29:30] [INFO ] Time to serialize gal into /tmp/LTL9642480714310294336.gal : 14 ms
[2022-05-20 22:29:30] [INFO ] Time to serialize properties into /tmp/LTL1085512178841538258.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/LTL9642480714310294336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1085512178841538258.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/LTL9642480...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu...3769
Formula 0 simplified : !FGF"(((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...3761
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2481863789480313417
[2022-05-20 22:29:45] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2481863789480313417
Running compilation step : cd /tmp/ltsmin2481863789480313417;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2481863789480313417;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2481863789480313417;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN16-LTLCardinality-03 finished in 705850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 102 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:48] [INFO ] Computed 47 place invariants in 258 ms
[2022-05-20 22:29:49] [INFO ] Implicit Places using invariants in 869 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:49] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-20 22:29:52] [INFO ] Implicit Places using invariants and state equation in 3541 ms returned []
Implicit Place search using SMT with State Equation took 4419 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:29:53] [INFO ] Computed 47 place invariants in 300 ms
[2022-05-20 22:29:54] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], 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]]
Product exploration timeout after 36220 steps with 160 reset in 10005 ms.
Product exploration timeout after 36000 steps with 159 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2664 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Probabilistic random walk after 229335 steps, saw 229264 distinct states, run finished after 6013 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:30:24] [INFO ] Computed 47 place invariants in 298 ms
[2022-05-20 22:30:24] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:30:31] [INFO ] After 7247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:30:32] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 40 ms returned sat
[2022-05-20 22:30:38] [INFO ] After 6273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:30:38] [INFO ] After 6417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 22:30:38] [INFO ] After 6638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:30:39] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-20 22:30:39] [INFO ] Implicit Places using invariants in 841 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:30:40] [INFO ] Computed 47 place invariants in 253 ms
[2022-05-20 22:30:43] [INFO ] Implicit Places using invariants and state equation in 3628 ms returned []
Implicit Place search using SMT with State Equation took 4471 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:30:43] [INFO ] Computed 47 place invariants in 259 ms
[2022-05-20 22:30:44] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2653 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Probabilistic random walk after 233502 steps, saw 233430 distinct states, run finished after 6020 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:30:54] [INFO ] Computed 47 place invariants in 304 ms
[2022-05-20 22:30:55] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 45 ms returned sat
[2022-05-20 22:31:02] [INFO ] After 7321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:31:02] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 39 ms returned sat
[2022-05-20 22:31:08] [INFO ] After 6277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:31:08] [INFO ] After 6401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-20 22:31:08] [INFO ] After 6621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 36270 steps with 160 reset in 10004 ms.
Product exploration timeout after 36060 steps with 159 reset in 10004 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 136 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2022-05-20 22:31:29] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:31:30] [INFO ] Computed 47 place invariants in 253 ms
[2022-05-20 22:31:31] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Product exploration timeout after 36210 steps with 160 reset in 10004 ms.
Product exploration timeout after 36040 steps with 159 reset in 10004 ms.
Built C files in :
/tmp/ltsmin16121810138881089432
[2022-05-20 22:31:51] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16121810138881089432
Running compilation step : cd /tmp/ltsmin16121810138881089432;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16121810138881089432;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16121810138881089432;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:31:54] [INFO ] Computed 47 place invariants in 289 ms
[2022-05-20 22:31:55] [INFO ] Implicit Places using invariants in 864 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:31:55] [INFO ] Computed 47 place invariants in 255 ms
[2022-05-20 22:31:58] [INFO ] Implicit Places using invariants and state equation in 3596 ms returned []
Implicit Place search using SMT with State Equation took 4485 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:31:59] [INFO ] Computed 47 place invariants in 252 ms
[2022-05-20 22:32:00] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin2487152915513408378
[2022-05-20 22:32:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2487152915513408378
Running compilation step : cd /tmp/ltsmin2487152915513408378;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2487152915513408378;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2487152915513408378;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:32:03] [INFO ] Flatten gal took : 147 ms
[2022-05-20 22:32:03] [INFO ] Flatten gal took : 146 ms
[2022-05-20 22:32:03] [INFO ] Time to serialize gal into /tmp/LTL4677504628257939894.gal : 13 ms
[2022-05-20 22:32:03] [INFO ] Time to serialize properties into /tmp/LTL781591205610846744.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/LTL4677504628257939894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL781591205610846744.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/LTL4677504...265
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2998
Formula 0 simplified : !XG"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2992
Detected timeout of ITS tools.
[2022-05-20 22:32:19] [INFO ] Flatten gal took : 143 ms
[2022-05-20 22:32:19] [INFO ] Applying decomposition
[2022-05-20 22:32:19] [INFO ] Flatten gal took : 143 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/graph7458499715231400403.txt' '-o' '/tmp/graph7458499715231400403.bin' '-w' '/tmp/graph7458499715231400403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7458499715231400403.bin' '-l' '-1' '-v' '-w' '/tmp/graph7458499715231400403.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:32:19] [INFO ] Decomposing Gal with order
[2022-05-20 22:32:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:32:20] [INFO ] Removed a total of 11520 redundant transitions.
[2022-05-20 22:32:20] [INFO ] Flatten gal took : 1019 ms
[2022-05-20 22:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-20 22:32:20] [INFO ] Time to serialize gal into /tmp/LTL1093730413749723917.gal : 11 ms
[2022-05-20 22:32:20] [INFO ] Time to serialize properties into /tmp/LTL4786916633310888036.ltl : 36 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/LTL1093730413749723917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4786916633310888036.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/LTL1093730...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((((gu256.Cells_0+gu256.Cells_1)+(gu256.Cells_2+gu256.Cells_3))+((gu256.Cells_4+gu256.Cells_5)+(gu256.Cells_6+gu256.Cells...4534
Formula 0 simplified : !XG"(((((((((gu256.Cells_0+gu256.Cells_1)+(gu256.Cells_2+gu256.Cells_3))+((gu256.Cells_4+gu256.Cells_5)+(gu256.Cells_6+gu256.Cells_7...4528
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8318610936067918603
[2022-05-20 22:32:36] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8318610936067918603
Running compilation step : cd /tmp/ltsmin8318610936067918603;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8318610936067918603;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8318610936067918603;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN16-LTLCardinality-09 finished in 170748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(!F(X((!G(X(p0))||p1))) U p2))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 100 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:32:39] [INFO ] Computed 768 place invariants in 20 ms
[2022-05-20 22:32:40] [INFO ] Implicit Places using invariants in 1100 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:32:40] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-20 22:32:41] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:32:41] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-20 22:32:43] [INFO ] Dead Transitions using invariants and state equation in 2468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 235 ms :[p2, p2, (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s4608 s4609 s4610 s4611 s4612 s4613 s4614 s4615 s4616 s4617 s4618 s4619 s4620 s4621 s4622 s4623 s4624 s4625 s4626 s4627 s4628 s4629 s4630 s463...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 16000 steps with 123 reset in 10009 ms.
Product exploration timeout after 15920 steps with 122 reset in 10003 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p2 (NOT p1) p0), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 195 ms :[p2, p2, (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4696 ms. (steps per millisecond=2 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1814 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1855 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:14] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-20 22:33:17] [INFO ] [Real]Absence check using 768 positive place invariants in 289 ms returned sat
[2022-05-20 22:33:18] [INFO ] After 1366ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:21] [INFO ] Computed 768 place invariants in 27 ms
Could not prove EG p2
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:38] [INFO ] Computed 768 place invariants in 17 ms
Could not prove EG (AND p0 (NOT p1))
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 51 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:53] [INFO ] Computed 768 place invariants in 22 ms
[2022-05-20 22:33:54] [INFO ] Implicit Places using invariants in 1176 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:54] [INFO ] Computed 768 place invariants in 21 ms
[2022-05-20 22:33:55] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:33:55] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-20 22:33:58] [INFO ] Dead Transitions using invariants and state equation in 2825 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p2), (X p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Finished random walk after 128 steps, including 0 resets, run visited all 3 properties in 68 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:34:03] [INFO ] Computed 768 place invariants in 16 ms
Could not prove EG p2
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:34:20] [INFO ] Computed 768 place invariants in 17 ms
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Product exploration timeout after 15920 steps with 122 reset in 10003 ms.
Product exploration timeout after 15930 steps with 122 reset in 10003 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 79 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2022-05-20 22:34:56] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:34:56] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-20 22:34:58] [INFO ] Dead Transitions using invariants and state equation in 2585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Product exploration timeout after 16040 steps with 123 reset in 10007 ms.
Product exploration timeout after 15950 steps with 122 reset in 10005 ms.
Built C files in :
/tmp/ltsmin13079108699970543876
[2022-05-20 22:35:19] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13079108699970543876
Running compilation step : cd /tmp/ltsmin13079108699970543876;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13079108699970543876;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13079108699970543876;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:35:22] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-20 22:35:23] [INFO ] Implicit Places using invariants in 1160 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:35:23] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-20 22:35:24] [INFO ] Implicit Places using invariants and state equation in 1172 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:35:24] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-20 22:35:27] [INFO ] Dead Transitions using invariants and state equation in 2700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin2478686167664317216
[2022-05-20 22:35:27] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2478686167664317216
Running compilation step : cd /tmp/ltsmin2478686167664317216;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2478686167664317216;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2478686167664317216;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:35:30] [INFO ] Flatten gal took : 233 ms
[2022-05-20 22:35:30] [INFO ] Flatten gal took : 199 ms
[2022-05-20 22:35:30] [INFO ] Time to serialize gal into /tmp/LTL14200009457087841455.gal : 17 ms
[2022-05-20 22:35:30] [INFO ] Time to serialize properties into /tmp/LTL10865166506735040744.ltl : 9 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/LTL14200009457087841455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10865166506735040744.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/LTL1420000...268
Read 1 LTL properties
Checking formula 0 : !((X(F(!((!(F(X((!(G(X("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns...111295
Formula 0 simplified : !XF!(!FX("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Boar...111274
Detected timeout of ITS tools.
[2022-05-20 22:35:46] [INFO ] Flatten gal took : 197 ms
[2022-05-20 22:35:46] [INFO ] Applying decomposition
[2022-05-20 22:35:46] [INFO ] Flatten gal took : 202 ms
[2022-05-20 22:36:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9465855873935425942.txt' '-o' '/tmp/graph9465855873935425942.bin' '-w' '/tmp/graph9465855873935425942.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:36:13] [INFO ] Flatten gal took : 192 ms
[2022-05-20 22:36:13] [INFO ] Time to serialize gal into /tmp/LTL15417489145495160327.gal : 15 ms
[2022-05-20 22:36:13] [INFO ] Time to serialize properties into /tmp/LTL3976379984771264447.ltl : 4 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/LTL15417489145495160327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3976379984771264447.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/LTL1541748...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!((!(F(X((!(G(X("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns...111295
Formula 0 simplified : !XF!(!FX("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Boar...111274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9398039802237372657
[2022-05-20 22:36:28] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9398039802237372657
Running compilation step : cd /tmp/ltsmin9398039802237372657;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9398039802237372657;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9398039802237372657;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN16-LTLCardinality-10 finished in 232204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(F(p0)) U G((X(p1)&&p1))))'
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 116 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:36:31] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-20 22:36:32] [INFO ] Implicit Places using invariants in 1467 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:36:32] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-20 22:36:34] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2924 ms to find 0 implicit places.
[2022-05-20 22:36:34] [INFO ] Redundant transitions in 159 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:36:34] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-20 22:36:37] [INFO ] Dead Transitions using invariants and state equation in 2834 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 104 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-13 finished in 6266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U p1)))'
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.10 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 82 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:37] [INFO ] Computed 47 place invariants in 272 ms
[2022-05-20 22:36:38] [INFO ] Implicit Places using invariants in 899 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:38] [INFO ] Computed 47 place invariants in 265 ms
[2022-05-20 22:36:42] [INFO ] Implicit Places using invariants and state equation in 3976 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
[2022-05-20 22:36:42] [INFO ] Redundant transitions in 156 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:42] [INFO ] Computed 47 place invariants in 258 ms
[2022-05-20 22:36:44] [INFO ] Dead Transitions using invariants and state equation in 1643 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 ...], 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 220 steps with 0 reset in 66 ms.
FORMULA Sudoku-COL-AN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLCardinality-14 finished in 6905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : Sudoku-COL-AN16-LTLCardinality-09
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.14 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 85 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:45] [INFO ] Computed 47 place invariants in 317 ms
[2022-05-20 22:36:45] [INFO ] Implicit Places using invariants in 904 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:45] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-20 22:36:49] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 4474 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:36:49] [INFO ] Computed 47 place invariants in 272 ms
[2022-05-20 22:36:50] [INFO ] Dead Transitions using invariants and state equation in 1441 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36540 steps with 161 reset in 10001 ms.
Product exploration timeout after 36500 steps with 161 reset in 10005 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2681 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Probabilistic random walk after 286331 steps, saw 286234 distinct states, run finished after 6009 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:37:20] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-20 22:37:20] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 47 ms returned sat
[2022-05-20 22:37:29] [INFO ] After 8468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:37:29] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:37:35] [INFO ] After 6454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:37:36] [INFO ] After 6597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-20 22:37:36] [INFO ] After 6828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:37:36] [INFO ] Computed 47 place invariants in 261 ms
[2022-05-20 22:37:37] [INFO ] Implicit Places using invariants in 821 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:37:37] [INFO ] Computed 47 place invariants in 264 ms
[2022-05-20 22:37:40] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:37:41] [INFO ] Computed 47 place invariants in 291 ms
[2022-05-20 22:37:42] [INFO ] Dead Transitions using invariants and state equation in 1449 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2667 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 307871 steps, run timeout after 6003 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 307871 steps, saw 307762 distinct states, run finished after 6005 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:37:52] [INFO ] Computed 47 place invariants in 264 ms
[2022-05-20 22:37:52] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 43 ms returned sat
[2022-05-20 22:37:59] [INFO ] After 7246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:37:59] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-20 22:38:05] [INFO ] After 6140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:38:05] [INFO ] After 6266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 22:38:06] [INFO ] After 6502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 36700 steps with 162 reset in 10006 ms.
Product exploration timeout after 36470 steps with 161 reset in 10003 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2022-05-20 22:38:26] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:38:27] [INFO ] Computed 47 place invariants in 264 ms
[2022-05-20 22:38:28] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Product exploration timeout after 36710 steps with 162 reset in 10001 ms.
Product exploration timeout after 36380 steps with 161 reset in 10003 ms.
Built C files in :
/tmp/ltsmin4633792854531546434
[2022-05-20 22:38:48] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4633792854531546434
Running compilation step : cd /tmp/ltsmin4633792854531546434;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4633792854531546434;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4633792854531546434;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 50 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:38:51] [INFO ] Computed 47 place invariants in 260 ms
[2022-05-20 22:38:52] [INFO ] Implicit Places using invariants in 859 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:38:52] [INFO ] Computed 47 place invariants in 290 ms
[2022-05-20 22:38:55] [INFO ] Implicit Places using invariants and state equation in 3631 ms returned []
Implicit Place search using SMT with State Equation took 4501 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-20 22:38:56] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-20 22:38:57] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin12421819245956354843
[2022-05-20 22:38:57] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12421819245956354843
Running compilation step : cd /tmp/ltsmin12421819245956354843;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12421819245956354843;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12421819245956354843;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:39:00] [INFO ] Flatten gal took : 153 ms
[2022-05-20 22:39:01] [INFO ] Flatten gal took : 163 ms
[2022-05-20 22:39:01] [INFO ] Time to serialize gal into /tmp/LTL14013494444476224496.gal : 13 ms
[2022-05-20 22:39:01] [INFO ] Time to serialize properties into /tmp/LTL4434020745149586841.ltl : 174 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/LTL14013494444476224496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4434020745149586841.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/LTL1401349...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2998
Formula 0 simplified : !XG"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2992
Detected timeout of ITS tools.
[2022-05-20 22:39:16] [INFO ] Flatten gal took : 138 ms
[2022-05-20 22:39:16] [INFO ] Applying decomposition
[2022-05-20 22:39:16] [INFO ] Flatten gal took : 138 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/graph15425465941899367272.txt' '-o' '/tmp/graph15425465941899367272.bin' '-w' '/tmp/graph15425465941899367272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15425465941899367272.bin' '-l' '-1' '-v' '-w' '/tmp/graph15425465941899367272.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:39:16] [INFO ] Decomposing Gal with order
[2022-05-20 22:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:39:18] [INFO ] Removed a total of 11520 redundant transitions.
[2022-05-20 22:39:18] [INFO ] Flatten gal took : 999 ms
[2022-05-20 22:39:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-20 22:39:18] [INFO ] Time to serialize gal into /tmp/LTL1508134423322986137.gal : 10 ms
[2022-05-20 22:39:18] [INFO ] Time to serialize properties into /tmp/LTL6697497737440724926.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/LTL1508134423322986137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6697497737440724926.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/LTL1508134...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((((((gu256.Cells_0+gu256.Cells_1)+(gu256.Cells_2+gu256.Cells_3))+((gu256.Cells_4+gu256.Cells_5)+(gu256.Cells_6+gu256.Cells...4534
Formula 0 simplified : !XG"(((((((((gu256.Cells_0+gu256.Cells_1)+(gu256.Cells_2+gu256.Cells_3))+((gu256.Cells_4+gu256.Cells_5)+(gu256.Cells_6+gu256.Cells_7...4528
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9288628380758142950
[2022-05-20 22:39:33] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9288628380758142950
Running compilation step : cd /tmp/ltsmin9288628380758142950;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9288628380758142950;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9288628380758142950;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN16-LTLCardinality-09 finished in 171966 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(!F(X((!G(X(p0))||p1))) U p2))))'
Found a CL insensitive property : Sudoku-COL-AN16-LTLCardinality-10
Stuttering acceptance computed with spot in 245 ms :[p2, p2, (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 64 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:39:36] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-20 22:39:37] [INFO ] Implicit Places using invariants in 1047 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:39:37] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-20 22:39:38] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:39:39] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-20 22:39:41] [INFO ] Dead Transitions using invariants and state equation in 2696 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-COL-AN16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s4608 s4609 s4610 s4611 s4612 s4613 s4614 s4615 s4616 s4617 s4618 s4619 s4620 s4621 s4622 s4623 s4624 s4625 s4626 s4627 s4628 s4629 s4630 s463...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 16090 steps with 123 reset in 10001 ms.
Product exploration timeout after 16000 steps with 123 reset in 10009 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p2 (NOT p1) p0), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[p2, p2, (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 4911 ms. (steps per millisecond=2 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:12] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-20 22:40:15] [INFO ] [Real]Absence check using 768 positive place invariants in 251 ms returned sat
[2022-05-20 22:40:15] [INFO ] After 1287ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:18] [INFO ] Computed 768 place invariants in 17 ms
Could not prove EG p2
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:35] [INFO ] Computed 768 place invariants in 185 ms
Could not prove EG (AND p0 (NOT p1))
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 48 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:50] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-20 22:40:51] [INFO ] Implicit Places using invariants in 1026 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:51] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-20 22:40:52] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:40:52] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-20 22:40:55] [INFO ] Dead Transitions using invariants and state equation in 2784 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p2), (X p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Finished random walk after 128 steps, including 0 resets, run visited all 3 properties in 70 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 3395 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:41:03] [INFO ] Computed 768 place invariants in 204 ms
Could not prove EG p2
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:41:20] [INFO ] Computed 768 place invariants in 18 ms
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Product exploration timeout after 16140 steps with 124 reset in 10006 ms.
Product exploration timeout after 16010 steps with 123 reset in 10009 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 813 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1)))]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2022-05-20 22:41:57] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:41:57] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-20 22:42:00] [INFO ] Dead Transitions using invariants and state equation in 2836 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Product exploration timeout after 16400 steps with 126 reset in 10004 ms.
Product exploration timeout after 15900 steps with 122 reset in 10003 ms.
Built C files in :
/tmp/ltsmin17946658211223565814
[2022-05-20 22:42:20] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17946658211223565814
Running compilation step : cd /tmp/ltsmin17946658211223565814;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17946658211223565814;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17946658211223565814;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:42:23] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-20 22:42:24] [INFO ] Implicit Places using invariants in 1045 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:42:24] [INFO ] Computed 768 place invariants in 41 ms
[2022-05-20 22:42:25] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-20 22:42:25] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-20 22:42:27] [INFO ] Dead Transitions using invariants and state equation in 2531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin9453976940160632653
[2022-05-20 22:42:28] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9453976940160632653
Running compilation step : cd /tmp/ltsmin9453976940160632653;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9453976940160632653;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9453976940160632653;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:42:31] [INFO ] Flatten gal took : 181 ms
[2022-05-20 22:42:31] [INFO ] Flatten gal took : 190 ms
[2022-05-20 22:42:31] [INFO ] Time to serialize gal into /tmp/LTL2471358220746293671.gal : 382 ms
[2022-05-20 22:42:31] [INFO ] Time to serialize properties into /tmp/LTL5812447579103783144.ltl : 6 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/LTL2471358220746293671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5812447579103783144.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/LTL2471358...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!((!(F(X((!(G(X("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns...111295
Formula 0 simplified : !XF!(!FX("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Boar...111274
Detected timeout of ITS tools.
[2022-05-20 22:42:47] [INFO ] Flatten gal took : 180 ms
[2022-05-20 22:42:47] [INFO ] Applying decomposition
[2022-05-20 22:42:47] [INFO ] Flatten gal took : 208 ms
[2022-05-20 22:43:36] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13401715271975861004.txt' '-o' '/tmp/graph13401715271975861004.bin' '-w' '/tmp/graph13401715271975861004.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:43:37] [INFO ] Flatten gal took : 180 ms
[2022-05-20 22:43:37] [INFO ] Time to serialize gal into /tmp/LTL5252982104202624359.gal : 677 ms
[2022-05-20 22:43:39] [INFO ] Time to serialize properties into /tmp/LTL5129350153428258090.ltl : 1716 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/LTL5252982104202624359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5129350153428258090.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/LTL5252982...266
Read 1 LTL properties
Checking formula 0 : !((X(F(!((!(F(X((!(G(X("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns...111295
Formula 0 simplified : !XF!(!FX("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Boar...111274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14401335066512867628
[2022-05-20 22:43:54] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14401335066512867628
Running compilation step : cd /tmp/ltsmin14401335066512867628;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14401335066512867628;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14401335066512867628;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN16-LTLCardinality-10 finished in 261155 ms.
[2022-05-20 22:43:57] [INFO ] Flatten gal took : 181 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3093028956737143238
[2022-05-20 22:43:57] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 22:43:57] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3093028956737143238
Running compilation step : cd /tmp/ltsmin3093028956737143238;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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-20 22:43:57] [INFO ] Applying decomposition
[2022-05-20 22:43:58] [INFO ] Flatten gal took : 189 ms
Compilation finished in 14995 ms.
Running link step : cd /tmp/ltsmin3093028956737143238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
gcc: error: model.o: No such file or directory
gcc: fatal error: no input files
compilation terminated.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin3093028956737143238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
java.lang.RuntimeException: Could not link executable .cd /tmp/ltsmin3093028956737143238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.linkPINS(LTSminRunner.java:342)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:44:22] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5758642002039602384.txt' '-o' '/tmp/graph5758642002039602384.bin' '-w' '/tmp/graph5758642002039602384.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 22:44:22] [INFO ] Flatten gal took : 184 ms
[2022-05-20 22:44:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality438646823213448782.gal : 2682 ms
[2022-05-20 22:44:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality267273506447018753.ltl : 12 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/LTLCardinality438646823213448782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality267273506447018753.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...286
Read 3 LTL properties
Checking formula 0 : !((F(G(F("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+R...2745
Formula 0 simplified : !FGF"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...2737
ITS-tools command line returned an error code 137
[2022-05-20 22:51:06] [INFO ] Applying decomposition
[2022-05-20 22:51:07] [INFO ] Flatten gal took : 421 ms
[2022-05-20 22:51:07] [INFO ] Decomposing Gal with order
[2022-05-20 22:51:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:51:09] [INFO ] Removed a total of 10512 redundant transitions.
[2022-05-20 22:51:09] [INFO ] Flatten gal took : 436 ms
[2022-05-20 22:51:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2022-05-20 22:51:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality11134315104718850679.gal : 28 ms
[2022-05-20 22:51:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality1952133508844852944.ltl : 10 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/LTLCardinality11134315104718850679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1952133508844852944.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...289
Read 3 LTL properties
Checking formula 0 : !((F(G(F("(((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8....4427
Formula 0 simplified : !FGF"(((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Row...4419
ITS-tools command line returned an error code 137
[2022-05-20 22:58:19] [INFO ] Flatten gal took : 368 ms
[2022-05-20 22:58:26] [INFO ] Input system was already deterministic with 4096 transitions.
[2022-05-20 22:58:26] [INFO ] Transformed 4864 places.
[2022-05-20 22:58:26] [INFO ] Transformed 4096 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-20 22:58:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality5197496127583576424.gal : 20 ms
[2022-05-20 22:58:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality1091624949702168816.ltl : 4 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/LTLCardinality5197496127583576424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1091624949702168816.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...333
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(F("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+R...2745
Formula 0 simplified : !FGF"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...2737
ITS-tools command line returned an error code 137
Total runtime 3027785 ms.
BK_STOP 1653088024004
--------------------
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-COL-AN16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN16, 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-165303545400163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN16.tgz
mv Sudoku-COL-AN16 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 ;