About the Execution of ITS-Tools for Sudoku-PT-AN06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.096 | 3600000.00 | 3219957.00 | 580736.00 | ?TTTFFTTFFFFFTTF | 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-165303545500243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 102K Apr 30 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 528K Apr 30 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 204K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 1012K Apr 30 11:56 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 65K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 232K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 386K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 32K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 132K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653096624726
Running Version 202205111006
[2022-05-21 01:30:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 01:30:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 01:30:26] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-21 01:30:26] [INFO ] Transformed 324 places.
[2022-05-21 01:30:26] [INFO ] Transformed 216 transitions.
[2022-05-21 01:30:26] [INFO ] Parsed PT model containing 324 places and 216 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:26] [INFO ] Computed 108 place invariants in 16 ms
[2022-05-21 01:30:26] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:26] [INFO ] Computed 108 place invariants in 6 ms
[2022-05-21 01:30:26] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:26] [INFO ] Computed 108 place invariants in 19 ms
[2022-05-21 01:30:26] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2022-05-21 01:30:26] [INFO ] Flatten gal took : 50 ms
[2022-05-21 01:30:27] [INFO ] Flatten gal took : 25 ms
[2022-05-21 01:30:27] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:27] [INFO ] Computed 108 place invariants in 7 ms
[2022-05-21 01:30:28] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-21 01:30:28] [INFO ] [Nat]Absence check using 108 positive place invariants in 16 ms returned sat
[2022-05-21 01:30:28] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :1
[2022-05-21 01:30:28] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-21 01:30:28] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :1
Fused 8 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(p0)))))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:29] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:29] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:29] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-21 01:30:29] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2022-05-21 01:30:29] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:29] [INFO ] Computed 108 place invariants in 3 ms
[2022-05-21 01:30:29] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD 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) (ADD 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 explored 100000 steps with 5263 reset in 2442 ms.
Product exploration explored 100000 steps with 5263 reset in 2374 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 161 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:35] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:35] [INFO ] [Real]Absence check using 108 positive place invariants in 25 ms returned sat
[2022-05-21 01:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 01:30:36] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-21 01:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 01:30:36] [INFO ] [Nat]Absence check using 108 positive place invariants in 73 ms returned sat
[2022-05-21 01:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 01:30:36] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-05-21 01:30:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-21 01:30:36] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:36] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:37] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:37] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:37] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2022-05-21 01:30:37] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:37] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:37] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 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 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 172 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 54 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:38] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:38] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2022-05-21 01:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 01:30:38] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-21 01:30:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 01:30:39] [INFO ] [Nat]Absence check using 108 positive place invariants in 75 ms returned sat
[2022-05-21 01:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 01:30:39] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2022-05-21 01:30:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-21 01:30:39] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5263 reset in 2285 ms.
Product exploration explored 100000 steps with 5263 reset in 2339 ms.
Built C files in :
/tmp/ltsmin14632200168735133828
[2022-05-21 01:30:44] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-21 01:30:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:44] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-21 01:30:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:44] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-21 01:30:44] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:44] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14632200168735133828
Running compilation step : cd /tmp/ltsmin14632200168735133828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 564 ms.
Running link step : cd /tmp/ltsmin14632200168735133828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14632200168735133828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3361647262977360584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:59] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:30:59] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:59] [INFO ] Computed 108 place invariants in 3 ms
[2022-05-21 01:30:59] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2022-05-21 01:30:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:30:59] [INFO ] Computed 108 place invariants in 11 ms
[2022-05-21 01:30:59] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin5081512686752742308
[2022-05-21 01:30:59] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-21 01:30:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:59] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-21 01:30:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:59] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-21 01:30:59] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:30:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5081512686752742308
Running compilation step : cd /tmp/ltsmin5081512686752742308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin5081512686752742308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5081512686752742308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1341063001456417965.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 01:31:15] [INFO ] Flatten gal took : 19 ms
[2022-05-21 01:31:15] [INFO ] Flatten gal took : 18 ms
[2022-05-21 01:31:15] [INFO ] Time to serialize gal into /tmp/LTL1305032990691383689.gal : 5 ms
[2022-05-21 01:31:15] [INFO ] Time to serialize properties into /tmp/LTL16083696965638482206.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/LTL1305032990691383689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16083696965638482206.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/LTL1305032...267
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+...3458
Formula 0 simplified : !GXGF"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+Rows...3448
Detected timeout of ITS tools.
[2022-05-21 01:31:30] [INFO ] Flatten gal took : 22 ms
[2022-05-21 01:31:30] [INFO ] Applying decomposition
[2022-05-21 01:31:30] [INFO ] Flatten gal took : 15 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/graph6411769530237475434.txt' '-o' '/tmp/graph6411769530237475434.bin' '-w' '/tmp/graph6411769530237475434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6411769530237475434.bin' '-l' '-1' '-v' '-w' '/tmp/graph6411769530237475434.weights' '-q' '0' '-e' '0.001'
[2022-05-21 01:31:30] [INFO ] Decomposing Gal with order
[2022-05-21 01:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 01:31:30] [INFO ] Removed a total of 247 redundant transitions.
[2022-05-21 01:31:30] [INFO ] Flatten gal took : 142 ms
[2022-05-21 01:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 11 ms.
[2022-05-21 01:31:30] [INFO ] Time to serialize gal into /tmp/LTL15280655143134095627.gal : 73 ms
[2022-05-21 01:31:30] [INFO ] Time to serialize properties into /tmp/LTL14012180474162930054.ltl : 3 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/LTL15280655143134095627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14012180474162930054.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/LTL1528065...268
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_1_0+gu0.Rows_1_1)))+...4466
Formula 0 simplified : !GXGF"(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_1_0+gu0.Rows_1_1)))+(((g...4456
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2831505743326650361
[2022-05-21 01:31:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2831505743326650361
Running compilation step : cd /tmp/ltsmin2831505743326650361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin2831505743326650361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2831505743326650361;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN06-LTLCardinality-00 finished in 91930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0))) U X(p1)))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 10 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:01] [INFO ] Computed 17 place invariants in 12 ms
[2022-05-21 01:32:01] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:01] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-21 01:32:01] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:01] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:01] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (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)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1671 ms.
Product exploration explored 100000 steps with 50000 reset in 1715 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-02 finished in 4210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (F(G(p2))&&p2)))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:32:05] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:32:05] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:32:05] [INFO ] Computed 108 place invariants in 3 ms
[2022-05-21 01:32:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 324 cols
[2022-05-21 01:32:05] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-21 01:32:05] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GT 3 (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)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-04 finished in 562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:05] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:05] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:05] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:05] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:05] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-21 01:32:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (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))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1648 ms.
Product exploration explored 100000 steps with 50000 reset in 1687 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-06 finished in 3962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&G(p1))))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 215 places and 0 transitions.
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 109 transition count 216
Applied a total of 215 rules in 14 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:09] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-21 01:32:09] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:10] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:10] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(GT 1 s34), p0:(LEQ s106 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-08 finished in 590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.7 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:10] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-21 01:32:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-05-21 01:32:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:10] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s61 s84)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 371 steps with 11 reset in 11 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-09 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 215 places and 0 transitions.
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 109 transition count 216
Applied a total of 215 rules in 6 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:10] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:10] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-21 01:32:10] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:11] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:11] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s36) (LEQ s31 s91))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 346 steps with 125 reset in 11 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-12 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(!(p1 U p2)))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 215 places and 0 transitions.
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 109 transition count 216
Applied a total of 215 rules in 2 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:11] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-21 01:32:11] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:11] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:11] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 109 cols
[2022-05-21 01:32:11] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-21 01:32:11] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 171 ms :[p2, p2, p2, p2, true]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ s36 s28) (LEQ 1 s45)), p1:(GT s21 s47), p2:(OR (LEQ s36 s28) (LEQ 1 s45))], 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]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-15 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(p0)))))'
[2022-05-21 01:32:11] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17142291853584960594
[2022-05-21 01:32:11] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-21 01:32:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:32:11] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-21 01:32:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:32:11] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-21 01:32:11] [INFO ] Applying decomposition
[2022-05-21 01:32:11] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 01:32:11] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17142291853584960594
Running compilation step : cd /tmp/ltsmin17142291853584960594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 01:32:11] [INFO ] Flatten gal took : 14 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/graph4485400859438952860.txt' '-o' '/tmp/graph4485400859438952860.bin' '-w' '/tmp/graph4485400859438952860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4485400859438952860.bin' '-l' '-1' '-v' '-w' '/tmp/graph4485400859438952860.weights' '-q' '0' '-e' '0.001'
[2022-05-21 01:32:12] [INFO ] Decomposing Gal with order
[2022-05-21 01:32:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 01:32:12] [INFO ] Removed a total of 276 redundant transitions.
[2022-05-21 01:32:12] [INFO ] Flatten gal took : 68 ms
[2022-05-21 01:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2022-05-21 01:32:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality15606028254508448025.gal : 2 ms
[2022-05-21 01:32:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality13807625596924338987.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/LTLCardinality15606028254508448025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13807625596924338987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_1_0+gu0.Rows_1_1)))+...4466
Formula 0 simplified : !GXGF"(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_1_0+gu0.Rows_1_1)))+(((g...4456
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin17142291853584960594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17142291853584960594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: LTL layer: formula: [](X([](<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.006: "[](X([](<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: buchi has 2 states
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.093: DFS-FIFO for weak LTL, using special progress label 218
pins2lts-mc-linux64( 0/ 8), 0.094: There are 219 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 325, there are 219 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.377: ~19 levels ~960 states ~18344 transitions
pins2lts-mc-linux64( 7/ 8), 0.395: ~19 levels ~1920 states ~19560 transitions
pins2lts-mc-linux64( 3/ 8), 0.425: ~19 levels ~3840 states ~21848 transitions
pins2lts-mc-linux64( 7/ 8), 0.485: ~19 levels ~7680 states ~31232 transitions
pins2lts-mc-linux64( 7/ 8), 0.579: ~19 levels ~15360 states ~45256 transitions
pins2lts-mc-linux64( 7/ 8), 0.787: ~19 levels ~30720 states ~78120 transitions
pins2lts-mc-linux64( 7/ 8), 1.098: ~19 levels ~61440 states ~149192 transitions
pins2lts-mc-linux64( 6/ 8), 1.761: ~19 levels ~122880 states ~361240 transitions
pins2lts-mc-linux64( 6/ 8), 2.944: ~19 levels ~245760 states ~735160 transitions
pins2lts-mc-linux64( 6/ 8), 4.942: ~19 levels ~491520 states ~1459240 transitions
pins2lts-mc-linux64( 6/ 8), 8.724: ~19 levels ~983040 states ~3117776 transitions
pins2lts-mc-linux64( 0/ 8), 16.392: ~19 levels ~1966080 states ~7124160 transitions
pins2lts-mc-linux64( 6/ 8), 31.338: ~19 levels ~3932160 states ~14886528 transitions
pins2lts-mc-linux64( 5/ 8), 62.118: ~19 levels ~7864320 states ~30681312 transitions
pins2lts-mc-linux64( 2/ 8), 114.120: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 114.598:
pins2lts-mc-linux64( 0/ 8), 114.599: mean standard work distribution: 2.1% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 114.599:
pins2lts-mc-linux64( 0/ 8), 114.599: Explored 13151397 states 56231135 transitions, fanout: 4.276
pins2lts-mc-linux64( 0/ 8), 114.600: Total exploration time 114.500 sec (114.120 sec minimum, 114.286 sec on average)
pins2lts-mc-linux64( 0/ 8), 114.600: States per second: 114859, Transitions per second: 491102
pins2lts-mc-linux64( 0/ 8), 114.600:
pins2lts-mc-linux64( 0/ 8), 114.600: Progress states detected: 15
pins2lts-mc-linux64( 0/ 8), 114.600: Redundant explorations: -0.1052
pins2lts-mc-linux64( 0/ 8), 114.600:
pins2lts-mc-linux64( 0/ 8), 114.600: Queue width: 8B, total height: 208, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 114.600: Tree memory: 356.4MB, 28.4 B/state, compr.: 2.2%
pins2lts-mc-linux64( 0/ 8), 114.600: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 114.600: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 114.600: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 114.600: Est. total memory use: 356.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17142291853584960594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17142291853584960594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 01:53:00] [INFO ] Flatten gal took : 172 ms
[2022-05-21 01:53:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality10101990487028874697.gal : 56 ms
[2022-05-21 01:53:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality26067025267904334.ltl : 5 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/LTLCardinality10101990487028874697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality26067025267904334.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...287
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+...3458
Formula 0 simplified : !GXGF"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+Rows...3448
Detected timeout of ITS tools.
[2022-05-21 02:13:42] [INFO ] Flatten gal took : 309 ms
[2022-05-21 02:13:43] [INFO ] Input system was already deterministic with 216 transitions.
[2022-05-21 02:13:43] [INFO ] Transformed 324 places.
[2022-05-21 02:13:43] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 02:13:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality7381752279036453555.gal : 4 ms
[2022-05-21 02:13:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality9440962873373509042.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/LTLCardinality7381752279036453555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9440962873373509042.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(G(F("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+...3458
Formula 0 simplified : !GXGF"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_1_0+Rows_1_1)))+(((Rows_1_2+Rows_1_3)+(Rows_1_4+Rows...3448
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN06, 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-165303545500243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN06.tgz
mv Sudoku-PT-AN06 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 ;