Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 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 DES-PT-60a-LTLCardinality-00
FORMULA_NAME DES-PT-60a-LTLCardinality-01
FORMULA_NAME DES-PT-60a-LTLCardinality-02
FORMULA_NAME DES-PT-60a-LTLCardinality-03
FORMULA_NAME DES-PT-60a-LTLCardinality-04
FORMULA_NAME DES-PT-60a-LTLCardinality-05
FORMULA_NAME DES-PT-60a-LTLCardinality-06
FORMULA_NAME DES-PT-60a-LTLCardinality-07
FORMULA_NAME DES-PT-60a-LTLCardinality-08
FORMULA_NAME DES-PT-60a-LTLCardinality-09
FORMULA_NAME DES-PT-60a-LTLCardinality-10
FORMULA_NAME DES-PT-60a-LTLCardinality-11
FORMULA_NAME DES-PT-60a-LTLCardinality-12
FORMULA_NAME DES-PT-60a-LTLCardinality-13
FORMULA_NAME DES-PT-60a-LTLCardinality-14
FORMULA_NAME DES-PT-60a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716341690869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 01:34:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:34:52] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-22 01:34:52] [INFO ] Transformed 354 places.
[2024-05-22 01:34:52] [INFO ] Transformed 311 transitions.
[2024-05-22 01:34:52] [INFO ] Found NUPN structural information;
[2024-05-22 01:34:52] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 353 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 353 transition count 296
Applied a total of 2 rules in 63 ms. Remains 353 /354 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 353 cols
[2024-05-22 01:34:52] [INFO ] Computed 59 invariants in 30 ms
[2024-05-22 01:34:53] [INFO ] Implicit Places using invariants in 354 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 352/354 places, 296/297 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 352/354 places, 296/297 transitions.
Support contains 29 out of 352 places after structural reductions.
[2024-05-22 01:34:53] [INFO ] Flatten gal took : 60 ms
[2024-05-22 01:34:53] [INFO ] Flatten gal took : 27 ms
[2024-05-22 01:34:53] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:34:54] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:34:54] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 01:34:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:34:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 124 ms returned sat
[2024-05-22 01:34:55] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-22 01:35:01] [INFO ] After 6805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 698 ms.
[2024-05-22 01:35:02] [INFO ] After 7943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 5 properties in 682 ms.
Support contains 12 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 295
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 352 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 351 transition count 294
Applied a total of 7 rules in 57 ms. Remains 351 /352 variables (removed 1) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 351/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 205 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 929269 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 929269 steps, saw 130150 distinct states, run finished after 3002 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 294 rows 351 cols
[2024-05-22 01:35:06] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 01:35:06] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 01:35:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:35:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2024-05-22 01:35:07] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 01:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:35:07] [INFO ] After 167ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 01:35:07] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 01:35:07] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-22 01:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-22 01:35:07] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 167 ms.
[2024-05-22 01:35:07] [INFO ] After 1384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 117 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 294/294 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1594451 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1594451 steps, saw 224692 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:11] [INFO ] Computed 60 invariants in 18 ms
[2024-05-22 01:35:11] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2024-05-22 01:35:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 105 ms returned sat
[2024-05-22 01:35:11] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:35:12] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:12] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 01:35:12] [INFO ] After 932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:35:12] [INFO ] Invariant cache hit.
[2024-05-22 01:35:12] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 01:35:12] [INFO ] Invariant cache hit.
[2024-05-22 01:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:35:12] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-05-22 01:35:12] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-22 01:35:12] [INFO ] Invariant cache hit.
[2024-05-22 01:35:13] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 914 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 21 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:13] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 01:35:13] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:35:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2024-05-22 01:35:13] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:13] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-22 01:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-22 01:35:13] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 01:35:13] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 255 stabilizing places and 250 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:35:14] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:35:14] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 01:35:14] [INFO ] Invariant cache hit.
[2024-05-22 01:35:14] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-22 01:35:14] [INFO ] Invariant cache hit.
[2024-05-22 01:35:14] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 352/352 places, 296/296 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DES-PT-60a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s71 1)), p1:(OR (EQ s131 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 324 ms.
Product exploration explored 100000 steps with 2241 reset in 270 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1615679 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{}
Probabilistic random walk after 1615679 steps, saw 223079 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:35:18] [INFO ] Invariant cache hit.
[2024-05-22 01:35:19] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:35:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:35:19] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:19] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:35:19] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 31 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1579332 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :{}
Probabilistic random walk after 1579332 steps, saw 221011 distinct states, run finished after 3003 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:22] [INFO ] Computed 60 invariants in 13 ms
[2024-05-22 01:35:22] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:35:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 99 ms returned sat
[2024-05-22 01:35:22] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:35:22] [INFO ] After 50ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:22] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 01:35:22] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:35:22] [INFO ] Invariant cache hit.
[2024-05-22 01:35:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 01:35:23] [INFO ] Invariant cache hit.
[2024-05-22 01:35:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:35:23] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-22 01:35:23] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-22 01:35:23] [INFO ] Invariant cache hit.
[2024-05-22 01:35:23] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 829 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 19 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:23] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:35:23] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:35:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2024-05-22 01:35:24] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:24] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:35:24] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:35:24] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:35:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 01:35:24] [INFO ] Invariant cache hit.
[2024-05-22 01:35:25] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 01:35:25] [INFO ] Invariant cache hit.
[2024-05-22 01:35:25] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1510179 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{}
Probabilistic random walk after 1510179 steps, saw 210296 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:35:28] [INFO ] Invariant cache hit.
[2024-05-22 01:35:28] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:35:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-22 01:35:28] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:28] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 01:35:28] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 29 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1468971 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1468971 steps, saw 205123 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:31] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 01:35:32] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:35:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2024-05-22 01:35:32] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:35:32] [INFO ] After 47ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:32] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 01:35:32] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:35:32] [INFO ] Invariant cache hit.
[2024-05-22 01:35:32] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:35:32] [INFO ] Invariant cache hit.
[2024-05-22 01:35:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:35:33] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-22 01:35:33] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-22 01:35:33] [INFO ] Invariant cache hit.
[2024-05-22 01:35:33] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:35:33] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:35:33] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:35:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:35:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2024-05-22 01:35:33] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:35:33] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:35:33] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2235 reset in 210 ms.
Product exploration explored 100000 steps with 2219 reset in 235 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:35:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:35:34] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:35:35] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17997740248119313889
[2024-05-22 01:35:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17997740248119313889
Running compilation step : cd /tmp/ltsmin17997740248119313889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin17997740248119313889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17997740248119313889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15498409455556430775.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:35:50] [INFO ] Invariant cache hit.
[2024-05-22 01:35:50] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:35:50] [INFO ] Invariant cache hit.
[2024-05-22 01:35:50] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-22 01:35:50] [INFO ] Invariant cache hit.
[2024-05-22 01:35:50] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin14597702205187431297
[2024-05-22 01:35:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14597702205187431297
Running compilation step : cd /tmp/ltsmin14597702205187431297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin14597702205187431297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14597702205187431297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13053031148349284838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:36:06] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:36:06] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:36:06] [INFO ] Time to serialize gal into /tmp/LTL16865987905689818616.gal : 4 ms
[2024-05-22 01:36:06] [INFO ] Time to serialize properties into /tmp/LTL16552577324394915634.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16865987905689818616.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1526264915390073004.hoa' '-atoms' '/tmp/LTL16552577324394915634.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16552577324394915634.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1526264915390073004.hoa
Detected timeout of ITS tools.
[2024-05-22 01:36:21] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:36:21] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:36:21] [INFO ] Time to serialize gal into /tmp/LTL10675774219948524878.gal : 4 ms
[2024-05-22 01:36:21] [INFO ] Time to serialize properties into /tmp/LTL16827571838510255460.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10675774219948524878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16827571838510255460.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p24==0)||(p71==1))"))&&(X(X(G("((p131==0)||(p46==1))"))))))
Formula 0 simplified : G!"((p24==0)||(p71==1))" | XXF!"((p131==0)||(p46==1))"
Detected timeout of ITS tools.
[2024-05-22 01:36:36] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:36:36] [INFO ] Applying decomposition
[2024-05-22 01:36:36] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4046942587538072934.txt' '-o' '/tmp/graph4046942587538072934.bin' '-w' '/tmp/graph4046942587538072934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4046942587538072934.bin' '-l' '-1' '-v' '-w' '/tmp/graph4046942587538072934.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:36:36] [INFO ] Decomposing Gal with order
[2024-05-22 01:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:36:36] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:36:36] [INFO ] Flatten gal took : 50 ms
[2024-05-22 01:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 01:36:36] [INFO ] Time to serialize gal into /tmp/LTL12054094871599385800.gal : 5 ms
[2024-05-22 01:36:36] [INFO ] Time to serialize properties into /tmp/LTL7707154516590773738.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12054094871599385800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7707154516590773738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((u13.p24==0)||(u47.p71==1))"))&&(X(X(G("((u12.p131==0)||(u13.p46==1))"))))))
Formula 0 simplified : G!"((u13.p24==0)||(u47.p71==1))" | XXF!"((u12.p131==0)||(u13.p46==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3737556188803835329
[2024-05-22 01:36:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3737556188803835329
Running compilation step : cd /tmp/ltsmin3737556188803835329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 509 ms.
Running link step : cd /tmp/ltsmin3737556188803835329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3737556188803835329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-00 finished in 112791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((p1||G(p2))))))'
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:37:06] [INFO ] Invariant cache hit.
[2024-05-22 01:37:06] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:37:06] [INFO ] Invariant cache hit.
[2024-05-22 01:37:07] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-22 01:37:07] [INFO ] Invariant cache hit.
[2024-05-22 01:37:07] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2386 reset in 241 ms.
Product exploration explored 100000 steps with 2406 reset in 270 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 257 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:37:08] [INFO ] Invariant cache hit.
[2024-05-22 01:37:09] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-05-22 01:37:09] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 31 ms returned sat
[2024-05-22 01:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:37:19] [INFO ] [Real]Absence check using state equation in 10197 ms returned sat
[2024-05-22 01:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:37:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 01:37:19] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 111 ms returned sat
[2024-05-22 01:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:37:21] [INFO ] [Nat]Absence check using state equation in 1888 ms returned sat
[2024-05-22 01:37:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:37:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-22 01:37:21] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 24 ms.
[2024-05-22 01:37:23] [INFO ] Added : 164 causal constraints over 33 iterations in 1903 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 16 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:37:23] [INFO ] Invariant cache hit.
[2024-05-22 01:37:23] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:37:23] [INFO ] Invariant cache hit.
[2024-05-22 01:37:24] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-22 01:37:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:37:24] [INFO ] Invariant cache hit.
[2024-05-22 01:37:24] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 737 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:37:24] [INFO ] Invariant cache hit.
[2024-05-22 01:37:24] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 01:37:24] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-22 01:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:37:34] [INFO ] [Real]Absence check using state equation in 10099 ms returned sat
[2024-05-22 01:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:37:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 01:37:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2024-05-22 01:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:37:37] [INFO ] [Nat]Absence check using state equation in 1863 ms returned sat
[2024-05-22 01:37:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:37:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-22 01:37:37] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 20 ms.
[2024-05-22 01:37:38] [INFO ] Added : 164 causal constraints over 33 iterations in 1843 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4611 reset in 221 ms.
Product exploration explored 100000 steps with 4654 reset in 251 ms.
Built C files in :
/tmp/ltsmin9994137131591184780
[2024-05-22 01:37:39] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:37:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:39] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:37:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:39] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:37:39] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:39] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9994137131591184780
Running compilation step : cd /tmp/ltsmin9994137131591184780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin9994137131591184780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9994137131591184780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased631564081434911221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:37:54] [INFO ] Invariant cache hit.
[2024-05-22 01:37:54] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 01:37:54] [INFO ] Invariant cache hit.
[2024-05-22 01:37:55] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-22 01:37:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:37:55] [INFO ] Invariant cache hit.
[2024-05-22 01:37:55] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin347905485632537440
[2024-05-22 01:37:55] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:37:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:55] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:37:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:55] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:37:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:37:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin347905485632537440
Running compilation step : cd /tmp/ltsmin347905485632537440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 632 ms.
Running link step : cd /tmp/ltsmin347905485632537440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin347905485632537440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased697293913533521299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:38:10] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:38:10] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:38:10] [INFO ] Time to serialize gal into /tmp/LTL949089610009438283.gal : 2 ms
[2024-05-22 01:38:10] [INFO ] Time to serialize properties into /tmp/LTL11722960085633426357.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL949089610009438283.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15030271709464749444.hoa' '-atoms' '/tmp/LTL11722960085633426357.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11722960085633426357.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15030271709464749444.hoa
Detected timeout of ITS tools.
[2024-05-22 01:38:25] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:38:25] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:38:25] [INFO ] Time to serialize gal into /tmp/LTL8791615129366328643.gal : 2 ms
[2024-05-22 01:38:25] [INFO ] Time to serialize properties into /tmp/LTL17087889529501021531.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8791615129366328643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17087889529501021531.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p309==1)")))||(G(("((p269==0)&&(p281==1))")||(G("(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))")))))))
Formula 0 simplified : X(FG!"(p309==1)" & F(!"((p269==0)&&(p281==1))" & F!"(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))"))
Detected timeout of ITS tools.
[2024-05-22 01:38:40] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:38:40] [INFO ] Applying decomposition
[2024-05-22 01:38:40] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3583751644163279455.txt' '-o' '/tmp/graph3583751644163279455.bin' '-w' '/tmp/graph3583751644163279455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3583751644163279455.bin' '-l' '-1' '-v' '-w' '/tmp/graph3583751644163279455.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:38:40] [INFO ] Decomposing Gal with order
[2024-05-22 01:38:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:38:40] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 01:38:40] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:38:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 01:38:40] [INFO ] Time to serialize gal into /tmp/LTL11100833675663854184.gal : 3 ms
[2024-05-22 01:38:40] [INFO ] Time to serialize properties into /tmp/LTL4991083571431074337.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11100833675663854184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4991083571431074337.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i5.u32.p309==1)")))||(G(("((u13.p269==0)&&(i6.u18.p281==1))")||(G("(((i1.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==0)&&(u...175
Formula 0 simplified : X(FG!"(i5.u32.p309==1)" & F(!"((u13.p269==0)&&(i6.u18.p281==1))" & F!"(((i1.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==0)&&(u14.p26=...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10835544716999560812
[2024-05-22 01:38:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10835544716999560812
Running compilation step : cd /tmp/ltsmin10835544716999560812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin10835544716999560812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10835544716999560812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 124191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:39:10] [INFO ] Invariant cache hit.
[2024-05-22 01:39:11] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 01:39:11] [INFO ] Invariant cache hit.
[2024-05-22 01:39:11] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 01:39:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:11] [INFO ] Invariant cache hit.
[2024-05-22 01:39:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 703 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s343 0) (EQ s173 1))], 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 40 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-05 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (X(p1)||G(p2))))'
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:39:11] [INFO ] Invariant cache hit.
[2024-05-22 01:39:11] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:39:11] [INFO ] Invariant cache hit.
[2024-05-22 01:39:12] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-22 01:39:12] [INFO ] Invariant cache hit.
[2024-05-22 01:39:12] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), p0, true, (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s336 1), p1:(OR (EQ s8 0) (EQ s136 1)), p0:(OR (EQ s3 0) (EQ s243 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 533 ms.
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLCardinality-06 finished in 2055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:39:13] [INFO ] Invariant cache hit.
[2024-05-22 01:39:13] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:39:13] [INFO ] Invariant cache hit.
[2024-05-22 01:39:14] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-22 01:39:14] [INFO ] Invariant cache hit.
[2024-05-22 01:39:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s145 0) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 380 ms.
Product exploration explored 100000 steps with 33333 reset in 402 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLCardinality-10 finished in 1594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:39:15] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:39:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:39:15] [INFO ] Invariant cache hit.
[2024-05-22 01:39:15] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-22 01:39:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:15] [INFO ] Invariant cache hit.
[2024-05-22 01:39:16] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 693 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s8 0) (EQ s215 1))) (NOT (OR (EQ s254 0) (EQ s33 1)))), p0:(OR (EQ s254 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-12 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:39:16] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:39:16] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:39:16] [INFO ] Invariant cache hit.
[2024-05-22 01:39:16] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 01:39:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:16] [INFO ] Invariant cache hit.
[2024-05-22 01:39:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 710 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s155 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2209 reset in 200 ms.
Product exploration explored 100000 steps with 2232 reset in 221 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1504235 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :{}
Probabilistic random walk after 1504235 steps, saw 209535 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:20] [INFO ] Invariant cache hit.
[2024-05-22 01:39:20] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:20] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:39:20] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:20] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-22 01:39:21] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1474181 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1474181 steps, saw 205738 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:39:24] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:39:24] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:39:24] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:39:24] [INFO ] After 73ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:24] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-22 01:39:24] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:39:24] [INFO ] Invariant cache hit.
[2024-05-22 01:39:24] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:39:24] [INFO ] Invariant cache hit.
[2024-05-22 01:39:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:39:25] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-05-22 01:39:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:39:25] [INFO ] Invariant cache hit.
[2024-05-22 01:39:25] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 788 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:39:25] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 01:39:25] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 01:39:25] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:25] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-22 01:39:25] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:39:26] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:39:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:39:26] [INFO ] Invariant cache hit.
[2024-05-22 01:39:26] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 01:39:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:39:26] [INFO ] Invariant cache hit.
[2024-05-22 01:39:26] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1486447 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :{}
Probabilistic random walk after 1486447 steps, saw 207491 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:29] [INFO ] Invariant cache hit.
[2024-05-22 01:39:29] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:30] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:39:30] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:30] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-22 01:39:30] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 294/296 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1476338 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1476338 steps, saw 206037 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:39:33] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:39:33] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:39:33] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:39:33] [INFO ] After 79ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:33] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-22 01:39:34] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 8 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 01:39:34] [INFO ] Invariant cache hit.
[2024-05-22 01:39:34] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:39:34] [INFO ] Invariant cache hit.
[2024-05-22 01:39:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:39:34] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2024-05-22 01:39:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:39:34] [INFO ] Invariant cache hit.
[2024-05-22 01:39:34] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 801 ms. Remains : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2024-05-22 01:39:34] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:39:34] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:39:35] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:35] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 01:39:35] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2214 reset in 203 ms.
Product exploration explored 100000 steps with 2213 reset in 222 ms.
Built C files in :
/tmp/ltsmin6423628281736383494
[2024-05-22 01:39:35] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:39:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:35] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:39:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:35] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:39:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:39:35] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6423628281736383494
Running compilation step : cd /tmp/ltsmin6423628281736383494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 636 ms.
Running link step : cd /tmp/ltsmin6423628281736383494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6423628281736383494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6404062182620467901.hoa' '--buchi-type=spotba'
LTSmin run took 1610 ms.
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60a-LTLCardinality-13 finished in 22118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:39:38] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:39:38] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:39:38] [INFO ] Invariant cache hit.
[2024-05-22 01:39:38] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-22 01:39:38] [INFO ] Invariant cache hit.
[2024-05-22 01:39:38] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s335 1), p0:(OR (EQ s39 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-14 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-00
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:39:39] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:39:39] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 01:39:39] [INFO ] Invariant cache hit.
[2024-05-22 01:39:39] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 01:39:39] [INFO ] Invariant cache hit.
[2024-05-22 01:39:40] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 694 ms. Remains : 351/352 places, 295/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s70 1)), p1:(OR (EQ s130 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2283 reset in 189 ms.
Product exploration explored 100000 steps with 2272 reset in 211 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1491077 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1491077 steps, saw 208021 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:43] [INFO ] Invariant cache hit.
[2024-05-22 01:39:43] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 111 ms returned sat
[2024-05-22 01:39:44] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:44] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 01:39:44] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1488853 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1488853 steps, saw 209427 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:47] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:39:47] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 174 ms returned sat
[2024-05-22 01:39:47] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:47] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:39:47] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:39:47] [INFO ] Invariant cache hit.
[2024-05-22 01:39:48] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 01:39:48] [INFO ] Invariant cache hit.
[2024-05-22 01:39:48] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-22 01:39:48] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:39:48] [INFO ] Invariant cache hit.
[2024-05-22 01:39:48] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:48] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 01:39:48] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 170 ms returned sat
[2024-05-22 01:39:49] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:49] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-22 01:39:49] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-22 01:39:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-22 01:39:49] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 01:39:49] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:39:49] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:39:49] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:39:49] [INFO ] Invariant cache hit.
[2024-05-22 01:39:50] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-22 01:39:50] [INFO ] Invariant cache hit.
[2024-05-22 01:39:50] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 351/351 places, 295/295 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1494811 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :{}
Probabilistic random walk after 1494811 steps, saw 208474 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:39:53] [INFO ] Invariant cache hit.
[2024-05-22 01:39:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:39:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 112 ms returned sat
[2024-05-22 01:39:54] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:54] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:39:54] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1475107 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1475107 steps, saw 207615 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:57] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:39:57] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 175 ms returned sat
[2024-05-22 01:39:57] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:57] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 01:39:57] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 01:39:57] [INFO ] Invariant cache hit.
[2024-05-22 01:39:57] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:39:57] [INFO ] Invariant cache hit.
[2024-05-22 01:39:58] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-22 01:39:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:39:58] [INFO ] Invariant cache hit.
[2024-05-22 01:39:58] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 702 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-22 01:39:58] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:39:58] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:39:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:39:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 175 ms returned sat
[2024-05-22 01:39:58] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:39:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-22 01:39:59] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:39:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2024-05-22 01:39:59] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:39:59] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2277 reset in 197 ms.
Product exploration explored 100000 steps with 2299 reset in 213 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-22 01:40:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 351 cols
[2024-05-22 01:40:00] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 01:40:00] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 351/351 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin10087161483921520586
[2024-05-22 01:40:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10087161483921520586
Running compilation step : cd /tmp/ltsmin10087161483921520586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin10087161483921520586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10087161483921520586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1679667679992990251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-22 01:40:15] [INFO ] Invariant cache hit.
[2024-05-22 01:40:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 01:40:15] [INFO ] Invariant cache hit.
[2024-05-22 01:40:15] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-22 01:40:15] [INFO ] Invariant cache hit.
[2024-05-22 01:40:16] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 351/351 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin13349538736886491983
[2024-05-22 01:40:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13349538736886491983
Running compilation step : cd /tmp/ltsmin13349538736886491983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 544 ms.
Running link step : cd /tmp/ltsmin13349538736886491983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13349538736886491983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17577401441239276333.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:40:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:40:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:40:31] [INFO ] Time to serialize gal into /tmp/LTL7253674353915692925.gal : 2 ms
[2024-05-22 01:40:31] [INFO ] Time to serialize properties into /tmp/LTL13311137586270014113.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7253674353915692925.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7170174380049557620.hoa' '-atoms' '/tmp/LTL13311137586270014113.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13311137586270014113.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7170174380049557620.hoa
Detected timeout of ITS tools.
[2024-05-22 01:40:46] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:40:46] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:40:46] [INFO ] Time to serialize gal into /tmp/LTL17075378183632195442.gal : 3 ms
[2024-05-22 01:40:46] [INFO ] Time to serialize properties into /tmp/LTL10992032218349231743.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17075378183632195442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10992032218349231743.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p24==0)||(p71==1))"))&&(X(X(G("((p131==0)||(p46==1))"))))))
Formula 0 simplified : G!"((p24==0)||(p71==1))" | XXF!"((p131==0)||(p46==1))"
Detected timeout of ITS tools.
[2024-05-22 01:41:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:41:01] [INFO ] Applying decomposition
[2024-05-22 01:41:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10295969589926336665.txt' '-o' '/tmp/graph10295969589926336665.bin' '-w' '/tmp/graph10295969589926336665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10295969589926336665.bin' '-l' '-1' '-v' '-w' '/tmp/graph10295969589926336665.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:41:01] [INFO ] Decomposing Gal with order
[2024-05-22 01:41:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:41:01] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-22 01:41:01] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:41:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2024-05-22 01:41:01] [INFO ] Time to serialize gal into /tmp/LTL11851212055741353386.gal : 3 ms
[2024-05-22 01:41:01] [INFO ] Time to serialize properties into /tmp/LTL4884722178811034504.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11851212055741353386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4884722178811034504.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i3.u14.p24==0)||(u48.p71==1))"))&&(X(X(G("((u12.p131==0)||(i3.u14.p46==1))"))))))
Formula 0 simplified : G!"((i3.u14.p24==0)||(u48.p71==1))" | XXF!"((u12.p131==0)||(i3.u14.p46==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1915218076784901025
[2024-05-22 01:41:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1915218076784901025
Running compilation step : cd /tmp/ltsmin1915218076784901025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin1915218076784901025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1915218076784901025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-00 finished in 112485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((p1||G(p2))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-02
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2024-05-22 01:41:31] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:41:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-22 01:41:32] [INFO ] Invariant cache hit.
[2024-05-22 01:41:32] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-22 01:41:32] [INFO ] Invariant cache hit.
[2024-05-22 01:41:32] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 692 ms. Remains : 352/352 places, 296/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2393 reset in 203 ms.
Product exploration explored 100000 steps with 2408 reset in 228 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 251 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:41:33] [INFO ] Invariant cache hit.
[2024-05-22 01:41:33] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-22 01:41:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2024-05-22 01:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:41:43] [INFO ] [Real]Absence check using state equation in 10083 ms returned sat
[2024-05-22 01:41:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:41:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 01:41:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2024-05-22 01:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:41:46] [INFO ] [Nat]Absence check using state equation in 1862 ms returned sat
[2024-05-22 01:41:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-22 01:41:46] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 20 ms.
[2024-05-22 01:41:47] [INFO ] Added : 164 causal constraints over 33 iterations in 1779 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:41:47] [INFO ] Invariant cache hit.
[2024-05-22 01:41:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 01:41:48] [INFO ] Invariant cache hit.
[2024-05-22 01:41:48] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-22 01:41:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:41:48] [INFO ] Invariant cache hit.
[2024-05-22 01:41:48] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:41:49] [INFO ] Invariant cache hit.
[2024-05-22 01:41:49] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:41:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2024-05-22 01:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:41:59] [INFO ] [Real]Absence check using state equation in 10089 ms returned sat
[2024-05-22 01:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:41:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 01:41:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 111 ms returned sat
[2024-05-22 01:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:42:01] [INFO ] [Nat]Absence check using state equation in 1844 ms returned sat
[2024-05-22 01:42:01] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-22 01:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-22 01:42:01] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-22 01:42:03] [INFO ] Added : 164 causal constraints over 33 iterations in 1770 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4490 reset in 219 ms.
Product exploration explored 100000 steps with 4660 reset in 234 ms.
Built C files in :
/tmp/ltsmin13436559107401670247
[2024-05-22 01:42:03] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:42:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:03] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:42:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:03] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:42:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:03] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13436559107401670247
Running compilation step : cd /tmp/ltsmin13436559107401670247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin13436559107401670247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13436559107401670247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1473173789987911506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 01:42:19] [INFO ] Invariant cache hit.
[2024-05-22 01:42:19] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 01:42:19] [INFO ] Invariant cache hit.
[2024-05-22 01:42:19] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-22 01:42:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:42:19] [INFO ] Invariant cache hit.
[2024-05-22 01:42:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin17959551741986447775
[2024-05-22 01:42:19] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:42:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:19] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:42:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:19] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:42:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:42:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17959551741986447775
Running compilation step : cd /tmp/ltsmin17959551741986447775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin17959551741986447775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17959551741986447775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7725497322916295980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:42:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:42:34] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:42:34] [INFO ] Time to serialize gal into /tmp/LTL11675153561190019617.gal : 2 ms
[2024-05-22 01:42:34] [INFO ] Time to serialize properties into /tmp/LTL9787558710755837307.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11675153561190019617.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10975989072647625423.hoa' '-atoms' '/tmp/LTL9787558710755837307.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9787558710755837307.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10975989072647625423.hoa
Detected timeout of ITS tools.
[2024-05-22 01:42:49] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:42:49] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:42:49] [INFO ] Time to serialize gal into /tmp/LTL3481292506230842311.gal : 2 ms
[2024-05-22 01:42:49] [INFO ] Time to serialize properties into /tmp/LTL10481909313804669833.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3481292506230842311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10481909313804669833.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p309==1)")))||(G(("((p269==0)&&(p281==1))")||(G("(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))")))))))
Formula 0 simplified : X(FG!"(p309==1)" & F(!"((p269==0)&&(p281==1))" & F!"(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))"))
Detected timeout of ITS tools.
[2024-05-22 01:43:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:43:04] [INFO ] Applying decomposition
[2024-05-22 01:43:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5478215913381306752.txt' '-o' '/tmp/graph5478215913381306752.bin' '-w' '/tmp/graph5478215913381306752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5478215913381306752.bin' '-l' '-1' '-v' '-w' '/tmp/graph5478215913381306752.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:43:05] [INFO ] Decomposing Gal with order
[2024-05-22 01:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:43:05] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:43:05] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 01:43:05] [INFO ] Time to serialize gal into /tmp/LTL897509755435191945.gal : 3 ms
[2024-05-22 01:43:05] [INFO ] Time to serialize properties into /tmp/LTL6358127428218093916.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL897509755435191945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6358127428218093916.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i6.i3.u31.p309==1)")))||(G(("((u12.p269==0)&&(i7.u17.p281==1))")||(G("(((i1.i0.u9.p264==0)&&(u13.p10==1))||((u2.p245==0)&&...177
Formula 0 simplified : X(FG!"(i6.i3.u31.p309==1)" & F(!"((u12.p269==0)&&(i7.u17.p281==1))" & F!"(((i1.i0.u9.p264==0)&&(u13.p10==1))||((u2.p245==0)&&(u13.p2...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14986771526879963255
[2024-05-22 01:43:20] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14986771526879963255
Running compilation step : cd /tmp/ltsmin14986771526879963255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin14986771526879963255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14986771526879963255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 123643 ms.
[2024-05-22 01:43:35] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7051801830281332795
[2024-05-22 01:43:35] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-05-22 01:43:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:35] [INFO ] Applying decomposition
[2024-05-22 01:43:35] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-05-22 01:43:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:43:35] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-05-22 01:43:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:43:35] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7051801830281332795
Running compilation step : cd /tmp/ltsmin7051801830281332795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12886798673567427091.txt' '-o' '/tmp/graph12886798673567427091.bin' '-w' '/tmp/graph12886798673567427091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12886798673567427091.bin' '-l' '-1' '-v' '-w' '/tmp/graph12886798673567427091.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:43:35] [INFO ] Decomposing Gal with order
[2024-05-22 01:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:43:35] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 01:43:35] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 01:43:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality14359093573015978519.gal : 3 ms
[2024-05-22 01:43:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality5571568390015749909.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14359093573015978519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5571568390015749909.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((F("((u14.p24==0)||(u48.p71==1))"))&&(X(X(G("((u13.p131==0)||(u14.p46==1))"))))))
Formula 0 simplified : G!"((u14.p24==0)||(u48.p71==1))" | XXF!"((u13.p131==0)||(u14.p46==1))"
Compilation finished in 646 ms.
Running link step : cd /tmp/ltsmin7051801830281332795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7051801830281332795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t256, t257, t289, u2.t8, u2.t130, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u...839
Computing Next relation with stutter on 8.35188e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: LTL layer: formula: (<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.011: "(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.128: DFS-FIFO for weak LTL, using special progress label 302
pins2lts-mc-linux64( 0/ 8), 0.128: There are 303 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.128: State length is 353, there are 307 groups
pins2lts-mc-linux64( 0/ 8), 0.128: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.128: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.128: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.128: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.179: ~1 levels ~960 states ~6232 transitions
pins2lts-mc-linux64( 2/ 8), 0.199: ~1 levels ~1920 states ~11592 transitions
pins2lts-mc-linux64( 2/ 8), 0.252: ~1 levels ~3840 states ~21696 transitions
pins2lts-mc-linux64( 2/ 8), 0.348: ~1 levels ~7680 states ~43512 transitions
pins2lts-mc-linux64( 2/ 8), 0.506: ~1 levels ~15360 states ~86256 transitions
pins2lts-mc-linux64( 2/ 8), 0.792: ~1 levels ~30720 states ~180224 transitions
pins2lts-mc-linux64( 2/ 8), 1.314: ~1 levels ~61440 states ~387936 transitions
pins2lts-mc-linux64( 1/ 8), 2.172: ~1 levels ~122880 states ~705520 transitions
pins2lts-mc-linux64( 3/ 8), 3.672: ~1 levels ~245760 states ~1319856 transitions
pins2lts-mc-linux64( 3/ 8), 6.566: ~1 levels ~491520 states ~3103344 transitions
pins2lts-mc-linux64( 3/ 8), 12.183: ~1 levels ~983040 states ~7466648 transitions
pins2lts-mc-linux64( 3/ 8), 24.078: ~1 levels ~1966080 states ~17447256 transitions
pins2lts-mc-linux64( 3/ 8), 48.786: ~1 levels ~3932160 states ~38660352 transitions
pins2lts-mc-linux64( 3/ 8), 97.644: ~1 levels ~7864320 states ~80852048 transitions
pins2lts-mc-linux64( 3/ 8), 195.488: ~1 levels ~15728640 states ~170015272 transitions
pins2lts-mc-linux64( 6/ 8), 274.542: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 274.579:
pins2lts-mc-linux64( 0/ 8), 274.579: mean standard work distribution: 3.4% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 274.579:
pins2lts-mc-linux64( 0/ 8), 274.579: Explored 20739139 states 234823764 transitions, fanout: 11.323
pins2lts-mc-linux64( 0/ 8), 274.579: Total exploration time 274.430 sec (274.390 sec minimum, 274.408 sec on average)
pins2lts-mc-linux64( 0/ 8), 274.579: States per second: 75572, Transitions per second: 855678
pins2lts-mc-linux64( 0/ 8), 274.579:
pins2lts-mc-linux64( 0/ 8), 274.579: Progress states detected: 32788274
pins2lts-mc-linux64( 0/ 8), 274.579: Redundant explorations: -36.7484
pins2lts-mc-linux64( 0/ 8), 274.579:
pins2lts-mc-linux64( 0/ 8), 274.579: Queue width: 8B, total height: 21449421, memory: 163.65MB
pins2lts-mc-linux64( 0/ 8), 274.579: Tree memory: 506.2MB, 16.2 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 274.579: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 274.579: Stored 308 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 274.579: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 274.579: Est. total memory use: 669.8MB (~1187.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7051801830281332795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7051801830281332795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
43025 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,430.281,2693548,1,0,7.36926e+06,358091,824,5.21548e+06,1951,2.87514e+06,1919374
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-60a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G(F("(i8.u32.p309==1)")))||(G(("((u13.p269==0)&&(i4.i2.u18.p281==1))")||(G("(((i0.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==0)&...178
Formula 1 simplified : X(FG!"(i8.u32.p309==1)" & F(!"((u13.p269==0)&&(i4.i2.u18.p281==1))" & F!"(((i0.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==0)&&(u14.p...166
Computing Next relation with stutter on 8.35188e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-22 02:06:29] [INFO ] Applying decomposition
[2024-05-22 02:06:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:06:29] [INFO ] Decomposing Gal with order
[2024-05-22 02:06:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:06:29] [INFO ] Removed a total of 431 redundant transitions.
[2024-05-22 02:06:29] [INFO ] Flatten gal took : 27 ms
[2024-05-22 02:06:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 7 ms.
[2024-05-22 02:06:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality18436869171236696077.gal : 2 ms
[2024-05-22 02:06:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality5499862539009935154.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18436869171236696077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5499862539009935154.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(u39.p309==1)")))||(G(("((u19.p269==0)&&(u25.p281==1))")||(G("(((u16.p264==0)&&(u1.p10==1))||((u7.p245==0)&&(u1.p26==1)))")...161
Formula 0 simplified : X(FG!"(u39.p309==1)" & F(!"((u19.p269==0)&&(u25.p281==1))" & F!"(((u16.p264==0)&&(u1.p10==1))||((u7.p245==0)&&(u1.p26==1)))"))
Detected timeout of ITS tools.
[2024-05-22 02:29:23] [INFO ] Flatten gal took : 19 ms
[2024-05-22 02:29:23] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-22 02:29:23] [INFO ] Transformed 352 places.
[2024-05-22 02:29:23] [INFO ] Transformed 296 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-22 02:29:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality6515063860465853616.gal : 3 ms
[2024-05-22 02:29:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality5821142455641932438.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6515063860465853616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5821142455641932438.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(F("(p309==1)")))||(G(("((p269==0)&&(p281==1))")||(G("(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))")))))))
Formula 0 simplified : X(FG!"(p309==1)" & F(!"((p269==0)&&(p281==1))" & F!"(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11869036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038240 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-60a, 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 r109-tall-171624208600467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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