Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872300028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANInsertWithFailure-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 8.8K May 30 15:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 30 15:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 30 15:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 15:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 15K May 30 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 30 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 30 15:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 5.6M May 29 12:20 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 CANInsertWithFailure-PT-030-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654665593699

Running Version 202205111006
[2022-06-08 05:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 05:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 05:19:57] [INFO ] Load time of PNML (sax parser for PT used): 794 ms
[2022-06-08 05:19:57] [INFO ] Transformed 2164 places.
[2022-06-08 05:19:57] [INFO ] Transformed 5580 transitions.
[2022-06-08 05:19:57] [INFO ] Parsed PT model containing 2164 places and 5580 transitions in 1067 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-030-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 586 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:19:58] [INFO ] Computed 32 place invariants in 426 ms
[2022-06-08 05:19:59] [INFO ] Implicit Places using invariants in 1847 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:20:00] [INFO ] Computed 32 place invariants in 285 ms
[2022-06-08 05:20:01] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:20:01] [INFO ] Computed 32 place invariants in 260 ms
[2022-06-08 05:20:06] [INFO ] Dead Transitions using invariants and state equation in 5255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 38 out of 2163 places after structural reductions.
[2022-06-08 05:20:07] [INFO ] Flatten gal took : 638 ms
[2022-06-08 05:20:08] [INFO ] Flatten gal took : 398 ms
[2022-06-08 05:20:08] [INFO ] Input system was already deterministic with 5580 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1104 ms. (steps per millisecond=9 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:20:10] [INFO ] Computed 32 place invariants in 167 ms
[2022-06-08 05:20:11] [INFO ] [Real]Absence check using 30 positive place invariants in 50 ms returned sat
[2022-06-08 05:20:11] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 50 ms returned sat
[2022-06-08 05:20:16] [INFO ] After 4754ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2022-06-08 05:20:16] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-06-08 05:20:19] [INFO ] After 2470ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-08 05:20:19] [INFO ] After 9088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-08 05:20:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 57 ms returned sat
[2022-06-08 05:20:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 47 ms returned sat
[2022-06-08 05:20:26] [INFO ] After 5975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-08 05:20:38] [INFO ] After 11536ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-08 05:20:47] [INFO ] Deduced a trap composed of 51 places in 3044 ms of which 12 ms to minimize.
[2022-06-08 05:20:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 05:20:47] [INFO ] After 28074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 3 properties in 134 ms.
Support contains 9 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 1956 transition count 5373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 1956 transition count 5372
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 865 Post agglomeration using F-continuation condition.Transition count delta: 865
Deduced a syphon composed of 865 places in 2 ms
Reduce places removed 865 places and 0 transitions.
Iterating global reduction 2 with 1730 rules applied. Total rules applied 2146 place count 1090 transition count 4507
Drop transitions removed 808 transitions
Redundant transition composition rules discarded 808 transitions
Iterating global reduction 2 with 808 rules applied. Total rules applied 2954 place count 1090 transition count 3699
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 2957 place count 1090 transition count 3696
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2960 place count 1087 transition count 3696
Partial Free-agglomeration rule applied 930 times.
Drop transitions removed 930 transitions
Iterating global reduction 3 with 930 rules applied. Total rules applied 3890 place count 1087 transition count 3696
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 3920 place count 1087 transition count 3696
Applied a total of 3920 rules in 1769 ms. Remains 1087 /2163 variables (removed 1076) and now considering 3696/5580 (removed 1884) transitions.
Finished structural reductions, in 1 iterations. Remains : 1087/2163 places, 3696/5580 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3696 rows 1087 cols
[2022-06-08 05:20:49] [INFO ] Computed 32 place invariants in 96 ms
[2022-06-08 05:20:50] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2022-06-08 05:20:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 24 ms returned sat
[2022-06-08 05:20:52] [INFO ] After 2412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-08 05:20:52] [INFO ] State equation strengthened by 3592 read => feed constraints.
[2022-06-08 05:20:53] [INFO ] After 796ms SMT Verify possible using 3592 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 05:20:53] [INFO ] After 3719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-08 05:20:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2022-06-08 05:20:53] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:20:55] [INFO ] After 1893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-08 05:20:57] [INFO ] After 1592ms SMT Verify possible using 3592 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-08 05:20:57] [INFO ] After 2192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 606 ms.
[2022-06-08 05:20:58] [INFO ] After 4948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 1087 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1087/1087 places, 3696/3696 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1085 transition count 3694
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1085 transition count 3694
Applied a total of 6 rules in 278 ms. Remains 1085 /1087 variables (removed 2) and now considering 3694/3696 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/1087 places, 3694/3696 transitions.
Finished random walk after 2073 steps, including 14 resets, run visited all 2 properties in 43 ms. (steps per millisecond=48 )
Computed a total of 122 stabilizing places and 210 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(!(G(X(G(X(!p0)))) U p1))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 964 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:00] [INFO ] Computed 32 place invariants in 115 ms
[2022-06-08 05:21:01] [INFO ] Implicit Places using invariants in 1052 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:01] [INFO ] Computed 32 place invariants in 74 ms
[2022-06-08 05:21:02] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:21:05] [INFO ] Implicit Places using invariants and state equation in 3522 ms returned []
Implicit Place search using SMT with State Equation took 4577 ms to find 0 implicit places.
[2022-06-08 05:21:05] [INFO ] Redundant transitions in 443 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:05] [INFO ] Computed 32 place invariants in 83 ms
[2022-06-08 05:21:09] [INFO ] Dead Transitions using invariants and state equation in 4107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 676 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s191 1), p0:(AND (GEQ s89 1) (GEQ s979 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 668 reset in 1088 ms.
Product exploration explored 100000 steps with 660 reset in 1492 ms.
Computed a total of 94 stabilizing places and 151 stable transitions
Computed a total of 94 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 7763 steps, including 51 resets, run visited all 3 properties in 320 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 235 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 239 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 91 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:14] [INFO ] Computed 32 place invariants in 54 ms
[2022-06-08 05:21:15] [INFO ] Implicit Places using invariants in 1063 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:15] [INFO ] Computed 32 place invariants in 91 ms
[2022-06-08 05:21:17] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:21:19] [INFO ] Implicit Places using invariants and state equation in 3599 ms returned []
Implicit Place search using SMT with State Equation took 4665 ms to find 0 implicit places.
[2022-06-08 05:21:19] [INFO ] Redundant transitions in 341 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:19] [INFO ] Computed 32 place invariants in 80 ms
[2022-06-08 05:21:23] [INFO ] Dead Transitions using invariants and state equation in 4220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/1085 places, 3691/3691 transitions.
Computed a total of 94 stabilizing places and 151 stable transitions
Computed a total of 94 stabilizing places and 151 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 246 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 2812 steps, including 18 resets, run visited all 3 properties in 137 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 275 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 269 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 351 ms :[p1, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 668 reset in 1126 ms.
Product exploration explored 100000 steps with 671 reset in 1006 ms.
Built C files in :
/tmp/ltsmin16478444626719371961
[2022-06-08 05:21:28] [INFO ] Too many transitions (3691) to apply POR reductions. Disabling POR matrices.
[2022-06-08 05:21:28] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16478444626719371961
Running compilation step : cd /tmp/ltsmin16478444626719371961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16478444626719371961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16478444626719371961;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 3691/3691 transitions.
Applied a total of 0 rules in 104 ms. Remains 1085 /1085 variables (removed 0) and now considering 3691/3691 (removed 0) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:31] [INFO ] Computed 32 place invariants in 56 ms
[2022-06-08 05:21:32] [INFO ] Implicit Places using invariants in 837 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:32] [INFO ] Computed 32 place invariants in 53 ms
[2022-06-08 05:21:34] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2628 ms to find 0 implicit places.
[2022-06-08 05:21:34] [INFO ] Redundant transitions in 372 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:21:34] [INFO ] Computed 32 place invariants in 86 ms
[2022-06-08 05:21:38] [INFO ] Dead Transitions using invariants and state equation in 3760 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/1085 places, 3691/3691 transitions.
Built C files in :
/tmp/ltsmin14672748257454555121
[2022-06-08 05:21:38] [INFO ] Too many transitions (3691) to apply POR reductions. Disabling POR matrices.
[2022-06-08 05:21:38] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14672748257454555121
Running compilation step : cd /tmp/ltsmin14672748257454555121;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14672748257454555121;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14672748257454555121;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 05:21:41] [INFO ] Flatten gal took : 200 ms
[2022-06-08 05:21:41] [INFO ] Flatten gal took : 118 ms
[2022-06-08 05:21:41] [INFO ] Time to serialize gal into /tmp/LTL10288253056854346918.gal : 26 ms
[2022-06-08 05:21:41] [INFO ] Time to serialize properties into /tmp/LTL12445583279943034432.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10288253056854346918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12445583279943034432.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1028825...268
Read 1 LTL properties
Checking formula 0 : !((F(G(X(F(!((G(X(G(X(!("((Node14IsInserted>=1)&&(Node26requestsent14>=1))"))))))U("(Node0GiveAnswer7>=1)"))))))))
Formula 0 simplified : !FGXF!(GXGX!"((Node14IsInserted>=1)&&(Node26requestsent14>=1))" U "(Node0GiveAnswer7>=1)")
Detected timeout of ITS tools.
[2022-06-08 05:21:57] [INFO ] Flatten gal took : 166 ms
[2022-06-08 05:21:57] [INFO ] Applying decomposition
[2022-06-08 05:21:57] [INFO ] Flatten gal took : 166 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5103842114302140298.txt' '-o' '/tmp/graph5103842114302140298.bin' '-w' '/tmp/graph5103842114302140298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5103842114302140298.bin' '-l' '-1' '-v' '-w' '/tmp/graph5103842114302140298.weights' '-q' '0' '-e' '0.001'
[2022-06-08 05:21:57] [INFO ] Decomposing Gal with order
[2022-06-08 05:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 05:21:59] [INFO ] Removed a total of 2707 redundant transitions.
[2022-06-08 05:21:59] [INFO ] Flatten gal took : 936 ms
[2022-06-08 05:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1741 labels/synchronizations in 267 ms.
[2022-06-08 05:21:59] [INFO ] Time to serialize gal into /tmp/LTL858202720624103521.gal : 35 ms
[2022-06-08 05:21:59] [INFO ] Time to serialize properties into /tmp/LTL17442357858123016054.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL858202720624103521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17442357858123016054.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8582027...245
Read 1 LTL properties
Checking formula 0 : !((F(G(X(F(!((G(X(G(X(!("((u15.Node14IsInserted>=1)&&(u27.Node26requestsent14>=1))"))))))U("(u8.Node0GiveAnswer7>=1)"))))))))
Formula 0 simplified : !FGXF!(GXGX!"((u15.Node14IsInserted>=1)&&(u27.Node26requestsent14>=1))" U "(u8.Node0GiveAnswer7>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12072738543625298229
[2022-06-08 05:22:14] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12072738543625298229
Running compilation step : cd /tmp/ltsmin12072738543625298229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12072738543625298229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12072738543625298229;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-00 finished in 78316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!F(p0) U G(F(G(X(p0))))))||F(p0))))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 124 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:17] [INFO ] Computed 32 place invariants in 154 ms
[2022-06-08 05:22:19] [INFO ] Implicit Places using invariants in 1660 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:19] [INFO ] Computed 32 place invariants in 250 ms
[2022-06-08 05:22:20] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:20] [INFO ] Computed 32 place invariants in 237 ms
[2022-06-08 05:22:26] [INFO ] Dead Transitions using invariants and state equation in 5897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2002 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][false, false]]
Stuttering criterion allowed to conclude after 714 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-02 finished in 8850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 634 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:27] [INFO ] Computed 32 place invariants in 54 ms
[2022-06-08 05:22:28] [INFO ] Implicit Places using invariants in 835 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:28] [INFO ] Computed 32 place invariants in 94 ms
[2022-06-08 05:22:29] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:22:31] [INFO ] Implicit Places using invariants and state equation in 3162 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2022-06-08 05:22:31] [INFO ] Redundant transitions in 256 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:31] [INFO ] Computed 32 place invariants in 85 ms
[2022-06-08 05:22:35] [INFO ] Dead Transitions using invariants and state equation in 4463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s614 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-03 finished in 9490 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((F(G(p0))||G(F(p0))))&&G(p1)))))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 652 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:36] [INFO ] Computed 32 place invariants in 51 ms
[2022-06-08 05:22:38] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:38] [INFO ] Computed 32 place invariants in 81 ms
[2022-06-08 05:22:38] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:22:41] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 4697 ms to find 0 implicit places.
[2022-06-08 05:22:41] [INFO ] Redundant transitions in 237 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:22:41] [INFO ] Computed 32 place invariants in 80 ms
[2022-06-08 05:22:45] [INFO ] Dead Transitions using invariants and state equation in 3621 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s733 1), p0:(GEQ s370 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 130 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-04 finished in 9309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0))&&G(p1)))||X(p2)))'
Support contains 6 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 88 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:45] [INFO ] Computed 32 place invariants in 229 ms
[2022-06-08 05:22:46] [INFO ] Implicit Places using invariants in 1274 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:46] [INFO ] Computed 32 place invariants in 237 ms
[2022-06-08 05:22:47] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:48] [INFO ] Computed 32 place invariants in 237 ms
[2022-06-08 05:22:53] [INFO ] Dead Transitions using invariants and state equation in 5734 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s342 1), p1:(OR (LT s413 1) (LT s827 1)), p0:(AND (OR (LT s7 1) (LT s1293 1)) (LT s1894 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 808 steps with 1 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-05 finished in 8564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p1)||p2)&&p0)))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 103 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:54] [INFO ] Computed 32 place invariants in 251 ms
[2022-06-08 05:22:55] [INFO ] Implicit Places using invariants in 1280 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:55] [INFO ] Computed 32 place invariants in 237 ms
[2022-06-08 05:22:56] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2990 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:22:57] [INFO ] Computed 32 place invariants in 203 ms
[2022-06-08 05:23:02] [INFO ] Dead Transitions using invariants and state equation in 5338 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s399 1) (GEQ s2161 1)), p2:(GEQ s877 1), p1:(AND (GEQ s2 1) (GEQ s395 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 683 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-07 finished in 8556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(G(p0))&&p0))||G((X(p1)&&p2))))'
Support contains 4 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 91 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:02] [INFO ] Computed 32 place invariants in 151 ms
[2022-06-08 05:23:03] [INFO ] Implicit Places using invariants in 1084 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:03] [INFO ] Computed 32 place invariants in 142 ms
[2022-06-08 05:23:06] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 3704 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:06] [INFO ] Computed 32 place invariants in 148 ms
[2022-06-08 05:23:12] [INFO ] Dead Transitions using invariants and state equation in 5878 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LT s2076 1), p0:(OR (LT s287 1) (LT s2029 1)), p1:(LT s425 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 141 reset in 667 ms.
Stack based approach found an accepted trace after 48673 steps with 67 reset with depth 799 and stack size 797 in 367 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-08 finished in 10848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U (F(p0)&&p1))||G(p2)||F(p2)))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 2163 transition count 5400
Reduce places removed 180 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 210 rules applied. Total rules applied 390 place count 1983 transition count 5370
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 2 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 3 with 1738 rules applied. Total rules applied 2158 place count 1084 transition count 4501
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 3 with 811 rules applied. Total rules applied 2969 place count 1084 transition count 3690
Applied a total of 2969 rules in 507 ms. Remains 1084 /2163 variables (removed 1079) and now considering 3690/5580 (removed 1890) transitions.
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:23:13] [INFO ] Computed 32 place invariants in 43 ms
[2022-06-08 05:23:14] [INFO ] Implicit Places using invariants in 975 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:23:14] [INFO ] Computed 32 place invariants in 65 ms
[2022-06-08 05:23:15] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:23:17] [INFO ] Implicit Places using invariants and state equation in 2885 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2022-06-08 05:23:17] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:23:17] [INFO ] Computed 32 place invariants in 44 ms
[2022-06-08 05:23:21] [INFO ] Dead Transitions using invariants and state equation in 3410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/2163 places, 3690/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/2163 places, 3690/5580 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0 p1), (AND (NOT p2) p0), (AND (NOT p2) p0 p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(OR (LT s2 1) (LT s87 1)), p0:(GEQ s896 1), p1:(AND (GEQ s2 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 2054 ms.
Product exploration explored 100000 steps with 50000 reset in 2326 ms.
Computed a total of 93 stabilizing places and 150 stable transitions
Computed a total of 93 stabilizing places and 150 stable transitions
Detected a total of 93/1084 stabilizing places and 150/3690 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 221 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-09 finished in 12771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(!(G(X(p0)) U p1))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 97 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:26] [INFO ] Computed 32 place invariants in 179 ms
[2022-06-08 05:23:27] [INFO ] Implicit Places using invariants in 1714 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:28] [INFO ] Computed 32 place invariants in 147 ms
[2022-06-08 05:23:29] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 3195 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:29] [INFO ] Computed 32 place invariants in 158 ms
[2022-06-08 05:23:35] [INFO ] Dead Transitions using invariants and state equation in 6613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, p1, p1, p1, p1]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s278 1) (GEQ s399 1) (GEQ s1790 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 138 reset in 575 ms.
Product exploration explored 100000 steps with 141 reset in 608 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 166 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81955 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81955 steps, saw 38248 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:40] [INFO ] Computed 32 place invariants in 140 ms
[2022-06-08 05:23:41] [INFO ] [Real]Absence check using 30 positive place invariants in 38 ms returned sat
[2022-06-08 05:23:41] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 37 ms returned sat
[2022-06-08 05:23:43] [INFO ] After 2575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:23:43] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-06-08 05:23:45] [INFO ] After 1739ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:23:45] [INFO ] After 4867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:23:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 46 ms returned sat
[2022-06-08 05:23:46] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 45 ms returned sat
[2022-06-08 05:23:48] [INFO ] After 2658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:23:51] [INFO ] After 2973ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:23:52] [INFO ] After 3609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 253 ms.
[2022-06-08 05:23:52] [INFO ] After 7055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 157 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 212 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 167 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:53] [INFO ] Computed 32 place invariants in 184 ms
[2022-06-08 05:23:55] [INFO ] Implicit Places using invariants in 1664 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:55] [INFO ] Computed 32 place invariants in 246 ms
[2022-06-08 05:23:57] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 4469 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:23:58] [INFO ] Computed 32 place invariants in 150 ms
[2022-06-08 05:24:03] [INFO ] Dead Transitions using invariants and state equation in 5773 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 179 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73183 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73183 steps, saw 35911 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:24:07] [INFO ] Computed 32 place invariants in 218 ms
[2022-06-08 05:24:07] [INFO ] [Real]Absence check using 30 positive place invariants in 29 ms returned sat
[2022-06-08 05:24:07] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 05:24:10] [INFO ] After 2502ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:24:10] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2022-06-08 05:24:12] [INFO ] After 1893ms SMT Verify possible using 1770 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:24:12] [INFO ] After 4862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:24:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 42 ms returned sat
[2022-06-08 05:24:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 45 ms returned sat
[2022-06-08 05:24:15] [INFO ] After 2820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:24:18] [INFO ] After 3056ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:24:19] [INFO ] After 3498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 226 ms.
[2022-06-08 05:24:19] [INFO ] After 7126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 139 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 137 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 140 reset in 588 ms.
Product exploration explored 100000 steps with 139 reset in 879 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 2163 transition count 5580
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 148 place count 2163 transition count 5580
Deduced a syphon composed of 180 places in 2 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 180 place count 2163 transition count 5580
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 240 place count 2103 transition count 5520
Deduced a syphon composed of 120 places in 2 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 300 place count 2103 transition count 5520
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: -1678
Deduced a syphon composed of 1017 places in 1 ms
Iterating global reduction 1 with 897 rules applied. Total rules applied 1197 place count 2103 transition count 7198
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 1313 place count 1987 transition count 7082
Deduced a syphon composed of 901 places in 2 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 1429 place count 1987 transition count 7082
Deduced a syphon composed of 901 places in 3 ms
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 1 with 811 rules applied. Total rules applied 2240 place count 1987 transition count 6271
Deduced a syphon composed of 901 places in 2 ms
Applied a total of 2240 rules in 1970 ms. Remains 1987 /2163 variables (removed 176) and now considering 6271/5580 (removed -691) transitions.
[2022-06-08 05:24:24] [INFO ] Redundant transitions in 454 ms returned []
// Phase 1: matrix 6271 rows 1987 cols
[2022-06-08 05:24:24] [INFO ] Computed 32 place invariants in 137 ms
[2022-06-08 05:24:30] [INFO ] Dead Transitions using invariants and state equation in 6477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1987/2163 places, 6271/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1987/2163 places, 6271/5580 transitions.
Product exploration explored 100000 steps with 635 reset in 1621 ms.
Product exploration explored 100000 steps with 630 reset in 1381 ms.
Built C files in :
/tmp/ltsmin9818634949911873912
[2022-06-08 05:24:33] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9818634949911873912
Running compilation step : cd /tmp/ltsmin9818634949911873912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9818634949911873912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9818634949911873912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 252 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:24:37] [INFO ] Computed 32 place invariants in 166 ms
[2022-06-08 05:24:38] [INFO ] Implicit Places using invariants in 1009 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:24:38] [INFO ] Computed 32 place invariants in 144 ms
[2022-06-08 05:24:39] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:24:39] [INFO ] Computed 32 place invariants in 220 ms
[2022-06-08 05:24:45] [INFO ] Dead Transitions using invariants and state equation in 6550 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Built C files in :
/tmp/ltsmin8649666836963119728
[2022-06-08 05:24:45] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8649666836963119728
Running compilation step : cd /tmp/ltsmin8649666836963119728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8649666836963119728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8649666836963119728;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-08 05:24:49] [INFO ] Flatten gal took : 242 ms
[2022-06-08 05:24:49] [INFO ] Flatten gal took : 235 ms
[2022-06-08 05:24:49] [INFO ] Time to serialize gal into /tmp/LTL10774866994372191576.gal : 44 ms
[2022-06-08 05:24:49] [INFO ] Time to serialize properties into /tmp/LTL16766712645263387355.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10774866994372191576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16766712645263387355.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1077486...268
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(!((G(X("((Node19Request>=1)&&(Node28IsInserted>=1))")))U("(((Node19Request>=1)&&(Node28IsInserted>=1))&&(Node23GiveAnswer16...169
Formula 0 simplified : !GXXX!(GX"((Node19Request>=1)&&(Node28IsInserted>=1))" U "(((Node19Request>=1)&&(Node28IsInserted>=1))&&(Node23GiveAnswer16>=1))")
Detected timeout of ITS tools.
[2022-06-08 05:25:04] [INFO ] Flatten gal took : 188 ms
[2022-06-08 05:25:04] [INFO ] Applying decomposition
[2022-06-08 05:25:04] [INFO ] Flatten gal took : 191 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph764443599462135496.txt' '-o' '/tmp/graph764443599462135496.bin' '-w' '/tmp/graph764443599462135496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph764443599462135496.bin' '-l' '-1' '-v' '-w' '/tmp/graph764443599462135496.weights' '-q' '0' '-e' '0.001'
[2022-06-08 05:25:05] [INFO ] Decomposing Gal with order
[2022-06-08 05:25:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 05:25:06] [INFO ] Removed a total of 2708 redundant transitions.
[2022-06-08 05:25:06] [INFO ] Flatten gal took : 598 ms
[2022-06-08 05:25:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2555 labels/synchronizations in 298 ms.
[2022-06-08 05:25:06] [INFO ] Time to serialize gal into /tmp/LTL3666582493882127182.gal : 41 ms
[2022-06-08 05:25:06] [INFO ] Time to serialize properties into /tmp/LTL8127646492606022752.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3666582493882127182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8127646492606022752.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3666582...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(!((G(X("((i32.u77.Node19Request>=1)&&(i0.i0.u109.Node28IsInserted>=1))")))U("(((i32.u77.Node19Request>=1)&&(i0.i0.u109.Node...211
Formula 0 simplified : !GXXX!(GX"((i32.u77.Node19Request>=1)&&(i0.i0.u109.Node28IsInserted>=1))" U "(((i32.u77.Node19Request>=1)&&(i0.i0.u109.Node28IsInser...195
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3620289944457482854
[2022-06-08 05:25:22] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3620289944457482854
Running compilation step : cd /tmp/ltsmin3620289944457482854;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3620289944457482854;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3620289944457482854;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-10 finished in 119012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&!(p1 U p2)&&(F(!p2)||F(p0))))'
Support contains 5 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 150 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:25] [INFO ] Computed 32 place invariants in 152 ms
[2022-06-08 05:25:26] [INFO ] Implicit Places using invariants in 929 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:26] [INFO ] Computed 32 place invariants in 173 ms
[2022-06-08 05:25:28] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3423 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:28] [INFO ] Computed 32 place invariants in 150 ms
[2022-06-08 05:25:34] [INFO ] Dead Transitions using invariants and state equation in 5779 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) p2), true, p2, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=0, aps=[p2:(GEQ s1760 1), p1:(AND (GEQ s35 1) (GEQ s54 1)), p0:(OR (LT s175 1) (LT s967 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2026 ms.
Product exploration explored 100000 steps with 33333 reset in 2056 ms.
Computed a total of 122 stabilizing places and 210 stable transitions
Computed a total of 122 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-11 finished in 14027 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((G(!G(!G(F(p0)))) U p1)))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 159 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:39] [INFO ] Computed 32 place invariants in 159 ms
[2022-06-08 05:25:40] [INFO ] Implicit Places using invariants in 1545 ms returned []
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:40] [INFO ] Computed 32 place invariants in 151 ms
[2022-06-08 05:25:43] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 4011 ms to find 0 implicit places.
// Phase 1: matrix 5580 rows 2163 cols
[2022-06-08 05:25:43] [INFO ] Computed 32 place invariants in 150 ms
[2022-06-08 05:25:49] [INFO ] Dead Transitions using invariants and state equation in 6006 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2163 places, 5580/5580 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (GEQ s1590 1) (AND (GEQ s12 1) (GEQ s245 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]]
Stuttering criterion allowed to conclude after 855 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-12 finished in 10339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U F(X(F(X(F(G(p1))))))))))'
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 869 Post agglomeration using F-continuation condition.Transition count delta: 869
Deduced a syphon composed of 869 places in 1 ms
Reduce places removed 869 places and 0 transitions.
Iterating global reduction 2 with 1738 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 689 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:25:50] [INFO ] Computed 32 place invariants in 52 ms
[2022-06-08 05:25:51] [INFO ] Implicit Places using invariants in 903 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:25:51] [INFO ] Computed 32 place invariants in 48 ms
[2022-06-08 05:25:51] [INFO ] State equation strengthened by 2667 read => feed constraints.
[2022-06-08 05:25:53] [INFO ] Implicit Places using invariants and state equation in 2798 ms returned []
Implicit Place search using SMT with State Equation took 3703 ms to find 0 implicit places.
[2022-06-08 05:25:54] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:25:54] [INFO ] Computed 32 place invariants in 47 ms
[2022-06-08 05:25:58] [INFO ] Dead Transitions using invariants and state equation in 4137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s571 1) (AND (GEQ s5 1) (GEQ s815 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 143 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-13 finished in 8776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(X(p0)) U X(X(G(p1))))||p0)))'
Support contains 2 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 2 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2156 place count 1085 transition count 4502
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2967 place count 1085 transition count 3691
Applied a total of 2967 rules in 632 ms. Remains 1085 /2163 variables (removed 1078) and now considering 3691/5580 (removed 1889) transitions.
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:25:58] [INFO ] Computed 32 place invariants in 54 ms
[2022-06-08 05:25:59] [INFO ] Implicit Places using invariants in 954 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:25:59] [INFO ] Computed 32 place invariants in 56 ms
[2022-06-08 05:26:00] [INFO ] State equation strengthened by 2665 read => feed constraints.
[2022-06-08 05:26:02] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2022-06-08 05:26:02] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 3691 rows 1085 cols
[2022-06-08 05:26:02] [INFO ] Computed 32 place invariants in 55 ms
[2022-06-08 05:26:05] [INFO ] Dead Transitions using invariants and state equation in 2989 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/2163 places, 3691/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1085/2163 places, 3691/5580 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1067 1), p1:(GEQ s232 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 156 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-14 finished in 7429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(!(G(X(G(X(!p0)))) U p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(!(G(X(p0)) U p1))))))'
Found a SL insensitive property : CANInsertWithFailure-PT-030-LTLFireability-10
Stuttering acceptance computed with spot in 144 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 2163 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 2163 transition count 5372
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 416 place count 1955 transition count 5371
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 2 with 1736 rules applied. Total rules applied 2154 place count 1086 transition count 4503
Drop transitions removed 811 transitions
Redundant transition composition rules discarded 811 transitions
Iterating global reduction 2 with 811 rules applied. Total rules applied 2965 place count 1086 transition count 3692
Applied a total of 2965 rules in 607 ms. Remains 1086 /2163 variables (removed 1077) and now considering 3692/5580 (removed 1888) transitions.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:06] [INFO ] Computed 32 place invariants in 71 ms
[2022-06-08 05:26:07] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:07] [INFO ] Computed 32 place invariants in 51 ms
[2022-06-08 05:26:08] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2022-06-08 05:26:10] [INFO ] Implicit Places using invariants and state equation in 2613 ms returned []
Implicit Place search using SMT with State Equation took 3530 ms to find 0 implicit places.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:10] [INFO ] Computed 32 place invariants in 54 ms
[2022-06-08 05:26:14] [INFO ] Dead Transitions using invariants and state equation in 4267 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1086/2163 places, 3692/5580 transitions.
Finished structural reductions, in 1 iterations. Remains : 1086/2163 places, 3692/5580 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s120 1) (GEQ s174 1) (GEQ s892 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 643 reset in 815 ms.
Product exploration explored 100000 steps with 648 reset in 823 ms.
Computed a total of 91 stabilizing places and 150 stable transitions
Computed a total of 91 stabilizing places and 150 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147821 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147821 steps, saw 28663 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:19] [INFO ] Computed 32 place invariants in 51 ms
[2022-06-08 05:26:19] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-06-08 05:26:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2022-06-08 05:26:20] [INFO ] After 1277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:26:20] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2022-06-08 05:26:21] [INFO ] After 511ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:21] [INFO ] After 2045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-06-08 05:26:21] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:26:22] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:23] [INFO ] After 880ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:24] [INFO ] After 1073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-06-08 05:26:24] [INFO ] After 2661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1086/1086 places, 3692/3692 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1086 transition count 3690
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1084 transition count 3690
Partial Free-agglomeration rule applied 932 times.
Drop transitions removed 932 transitions
Iterating global reduction 1 with 932 rules applied. Total rules applied 936 place count 1084 transition count 3690
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1084 transition count 3690
Applied a total of 966 rules in 503 ms. Remains 1084 /1086 variables (removed 2) and now considering 3690/3692 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/1086 places, 3690/3692 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152342 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152342 steps, saw 29320 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:26:27] [INFO ] Computed 32 place invariants in 50 ms
[2022-06-08 05:26:28] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-06-08 05:26:28] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 21 ms returned sat
[2022-06-08 05:26:29] [INFO ] After 1332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:26:29] [INFO ] State equation strengthened by 3597 read => feed constraints.
[2022-06-08 05:26:30] [INFO ] After 854ms SMT Verify possible using 3597 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:30] [INFO ] After 2468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2022-06-08 05:26:30] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:26:31] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:32] [INFO ] After 740ms SMT Verify possible using 3597 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:32] [INFO ] After 1049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2022-06-08 05:26:33] [INFO ] After 2753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 132 ms :[true, p1, p1, p1, p1]
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 3692/3692 transitions.
Applied a total of 0 rules in 79 ms. Remains 1086 /1086 variables (removed 0) and now considering 3692/3692 (removed 0) transitions.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:33] [INFO ] Computed 32 place invariants in 51 ms
[2022-06-08 05:26:34] [INFO ] Implicit Places using invariants in 899 ms returned []
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:34] [INFO ] Computed 32 place invariants in 52 ms
[2022-06-08 05:26:35] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2022-06-08 05:26:37] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 3482 ms to find 0 implicit places.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:37] [INFO ] Computed 32 place invariants in 53 ms
[2022-06-08 05:26:40] [INFO ] Dead Transitions using invariants and state equation in 3218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1086/1086 places, 3692/3692 transitions.
Computed a total of 91 stabilizing places and 150 stable transitions
Computed a total of 91 stabilizing places and 150 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 64 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147216 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147216 steps, saw 28589 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3692 rows 1086 cols
[2022-06-08 05:26:43] [INFO ] Computed 32 place invariants in 52 ms
[2022-06-08 05:26:43] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2022-06-08 05:26:43] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:26:45] [INFO ] After 1268ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:26:45] [INFO ] State equation strengthened by 2666 read => feed constraints.
[2022-06-08 05:26:45] [INFO ] After 522ms SMT Verify possible using 2666 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:45] [INFO ] After 2050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:45] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-06-08 05:26:45] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:26:47] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:48] [INFO ] After 874ms SMT Verify possible using 2666 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:48] [INFO ] After 1065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-06-08 05:26:48] [INFO ] After 2704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1086/1086 places, 3692/3692 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1086 transition count 3690
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1084 transition count 3690
Partial Free-agglomeration rule applied 932 times.
Drop transitions removed 932 transitions
Iterating global reduction 1 with 932 rules applied. Total rules applied 936 place count 1084 transition count 3690
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 966 place count 1084 transition count 3690
Applied a total of 966 rules in 485 ms. Remains 1084 /1086 variables (removed 2) and now considering 3690/3692 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1084/1086 places, 3690/3692 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153668 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153668 steps, saw 29455 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3690 rows 1084 cols
[2022-06-08 05:26:52] [INFO ] Computed 32 place invariants in 51 ms
[2022-06-08 05:26:52] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2022-06-08 05:26:52] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2022-06-08 05:26:53] [INFO ] After 1332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 05:26:53] [INFO ] State equation strengthened by 3597 read => feed constraints.
[2022-06-08 05:26:54] [INFO ] After 839ms SMT Verify possible using 3597 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:54] [INFO ] After 2439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 05:26:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-06-08 05:26:54] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2022-06-08 05:26:56] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:56] [INFO ] After 742ms SMT Verify possible using 3597 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 05:26:57] [INFO ] After 1050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-06-08 05:26:57] [INFO ] After 2731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 141 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 226 ms :[true, p1, p1, p1, p1]
Entered a terminal (fully accepting) state of product in 55615 steps with 359 reset in 446 ms.
Treatment of property CANInsertWithFailure-PT-030-LTLFireability-10 finished in 52557 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
[2022-06-08 05:26:58] [INFO ] Flatten gal took : 149 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17195540577749043031
[2022-06-08 05:26:58] [INFO ] Too many transitions (5580) to apply POR reductions. Disabling POR matrices.
[2022-06-08 05:26:58] [INFO ] Applying decomposition
[2022-06-08 05:26:58] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17195540577749043031
Running compilation step : cd /tmp/ltsmin17195540577749043031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-08 05:26:58] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4842293277642309148.txt' '-o' '/tmp/graph4842293277642309148.bin' '-w' '/tmp/graph4842293277642309148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4842293277642309148.bin' '-l' '-1' '-v' '-w' '/tmp/graph4842293277642309148.weights' '-q' '0' '-e' '0.001'
[2022-06-08 05:26:59] [INFO ] Decomposing Gal with order
[2022-06-08 05:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 05:26:59] [INFO ] Removed a total of 2705 redundant transitions.
[2022-06-08 05:26:59] [INFO ] Flatten gal took : 388 ms
[2022-06-08 05:27:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2729 labels/synchronizations in 164 ms.
[2022-06-08 05:27:00] [INFO ] Time to serialize gal into /tmp/LTLFireability4065464209257072719.gal : 38 ms
[2022-06-08 05:27:00] [INFO ] Time to serialize properties into /tmp/LTLFireability11026389280577709406.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4065464209257072719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11026389280577709406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F(G(X(F(!((G(X(G(X(!("((i28.u55.Node14IsInserted>=1)&&(i44.u104.Node26requestsent14>=1))"))))))U("(i15.u29.Node0GiveAnswer7>=1)")))...160
Formula 0 simplified : !FGXF!(GXGX!"((i28.u55.Node14IsInserted>=1)&&(i44.u104.Node26requestsent14>=1))" U "(i15.u29.Node0GiveAnswer7>=1)")
Compilation finished in 30143 ms.
Running link step : cd /tmp/ltsmin17195540577749043031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin17195540577749043031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](X(<>(!([](X([](X(!(LTLAPp0==true))))) U (LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 30109 ms.
FORMULA CANInsertWithFailure-PT-030-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 483076 ms.

BK_STOP 1654666079226

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872300028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;