About the Execution of ITS-Tools for CANInsertWithFailure-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14013.936 | 3600000.00 | 13182510.00 | 1828.00 | FFFFFFF?FTFFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872300044.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-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K May 30 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 30 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 30 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 16K May 30 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 30 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 30 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K May 30 15:29 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 16M 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-050-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654691419809
Running Version 202205111006
[2022-06-08 12:30:22] [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 12:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 12:30:23] [INFO ] Load time of PNML (sax parser for PT used): 1382 ms
[2022-06-08 12:30:23] [INFO ] Transformed 5604 places.
[2022-06-08 12:30:23] [INFO ] Transformed 15300 transitions.
[2022-06-08 12:30:23] [INFO ] Parsed PT model containing 5604 places and 15300 transitions in 1741 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1406 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:30:27] [INFO ] Computed 52 place invariants in 1821 ms
[2022-06-08 12:30:29] [INFO ] Implicit Places using invariants in 3401 ms returned []
Implicit Place search using SMT only with invariants took 3448 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:30:30] [INFO ] Computed 52 place invariants in 1559 ms
[2022-06-08 12:30:31] [INFO ] Dead Transitions using invariants and state equation in 2694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 49 out of 5603 places after structural reductions.
[2022-06-08 12:30:33] [INFO ] Flatten gal took : 1047 ms
[2022-06-08 12:30:33] [INFO ] Flatten gal took : 518 ms
[2022-06-08 12:30:35] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 47 out of 5603 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 1130 ms. (steps per millisecond=8 ) properties (out of 34) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:30:38] [INFO ] Computed 52 place invariants in 1933 ms
[2022-06-08 12:30:42] [INFO ] [Real]Absence check using 50 positive place invariants in 128 ms returned sat
[2022-06-08 12:30:42] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 179 ms returned sat
[2022-06-08 12:31:03] [INFO ] After 19227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:4
[2022-06-08 12:31:04] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-06-08 12:31:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-08 12:31:04] [INFO ] After 25298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 269 ms.
Support contains 18 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 5603 transition count 14954
Reduce places removed 346 places and 0 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 692 place count 5257 transition count 14954
Performed 2441 Post agglomeration using F-continuation condition.Transition count delta: 2441
Deduced a syphon composed of 2441 places in 8 ms
Reduce places removed 2441 places and 0 transitions.
Iterating global reduction 2 with 4882 rules applied. Total rules applied 5574 place count 2816 transition count 12513
Drop transitions removed 2343 transitions
Redundant transition composition rules discarded 2343 transitions
Iterating global reduction 2 with 2343 rules applied. Total rules applied 7917 place count 2816 transition count 10170
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7922 place count 2816 transition count 10165
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 7927 place count 2811 transition count 10165
Partial Free-agglomeration rule applied 2546 times.
Drop transitions removed 2546 transitions
Iterating global reduction 3 with 2546 rules applied. Total rules applied 10473 place count 2811 transition count 10165
Applied a total of 10473 rules in 6313 ms. Remains 2811 /5603 variables (removed 2792) and now considering 10165/15300 (removed 5135) transitions.
Finished structural reductions, in 1 iterations. Remains : 2811/5603 places, 10165/15300 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 793 ms. (steps per millisecond=12 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) 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 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10165 rows 2811 cols
[2022-06-08 12:31:12] [INFO ] Computed 52 place invariants in 600 ms
[2022-06-08 12:31:13] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 12:31:13] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 78 ms returned sat
[2022-06-08 12:31:19] [INFO ] After 5672ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-06-08 12:31:19] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2022-06-08 12:31:24] [INFO ] After 4547ms SMT Verify possible using 9984 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-08 12:31:24] [INFO ] After 11960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-08 12:31:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 56 ms returned sat
[2022-06-08 12:31:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 47 ms returned sat
[2022-06-08 12:31:31] [INFO ] After 6002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-08 12:31:35] [INFO ] After 3738ms SMT Verify possible using 9984 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-08 12:31:38] [INFO ] After 6744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2191 ms.
[2022-06-08 12:31:40] [INFO ] After 16223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 55 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 4 properties in 6 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(G(p0))||X((p1 U p2))))||X(G(p1))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 993 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:31:43] [INFO ] Computed 52 place invariants in 1735 ms
[2022-06-08 12:31:44] [INFO ] Implicit Places using invariants in 2580 ms returned []
Implicit Place search using SMT only with invariants took 2582 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:31:46] [INFO ] Computed 52 place invariants in 1569 ms
[2022-06-08 12:31:47] [INFO ] Dead Transitions using invariants and state equation in 2443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 747 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LT s3184 1), p1:(AND (GEQ s180 1) (GEQ s651 1)), p2:(GEQ s4989 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24947 reset in 4269 ms.
Product exploration explored 100000 steps with 25040 reset in 3922 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1180 ms. Reduced automaton from 8 states, 20 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 69301 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69301 steps, saw 59755 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:32:02] [INFO ] Computed 52 place invariants in 1529 ms
[2022-06-08 12:32:03] [INFO ] [Real]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 12:32:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 109 ms returned sat
[2022-06-08 12:32:15] [INFO ] After 12210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 12:32:16] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-06-08 12:32:18] [INFO ] After 2737ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:32:18] [INFO ] After 16434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:32:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 12:32:20] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 99 ms returned sat
[2022-06-08 12:32:32] [INFO ] After 11799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 12:32:41] [INFO ] After 9700ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-08 12:32:41] [INFO ] After 22913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 5 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7951 place count 2803 transition count 10149
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 3 with 2551 rules applied. Total rules applied 10502 place count 2803 transition count 10149
Applied a total of 10502 rules in 5180 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10149/15300 (removed 5151) transitions.
Finished structural reductions, in 1 iterations. Remains : 2803/5603 places, 10149/15300 transitions.
Finished random walk after 3535 steps, including 15 resets, run visited all 1 properties in 69 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT p1))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 21 factoid took 851 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 5603 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 1004 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:32:50] [INFO ] Computed 52 place invariants in 1555 ms
[2022-06-08 12:32:51] [INFO ] Implicit Places using invariants in 2832 ms returned []
Implicit Place search using SMT only with invariants took 2835 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:32:53] [INFO ] Computed 52 place invariants in 1536 ms
[2022-06-08 12:32:54] [INFO ] Dead Transitions using invariants and state equation in 2585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 169 ms. (steps per millisecond=59 ) 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 67760 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67760 steps, saw 59292 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:33:00] [INFO ] Computed 52 place invariants in 1899 ms
[2022-06-08 12:33:01] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 12:33:01] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 121 ms returned sat
[2022-06-08 12:33:13] [INFO ] After 11626ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 12:33:13] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-06-08 12:33:15] [INFO ] After 2762ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:33:15] [INFO ] After 15774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:33:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 12:33:17] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 103 ms returned sat
[2022-06-08 12:33:27] [INFO ] After 10666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 12:33:37] [INFO ] After 9595ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-08 12:33:37] [INFO ] After 21456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 6 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7951 place count 2803 transition count 10149
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 3 with 2551 rules applied. Total rules applied 10502 place count 2803 transition count 10149
Applied a total of 10502 rules in 4612 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10149/15300 (removed 5151) transitions.
Finished structural reductions, in 1 iterations. Remains : 2803/5603 places, 10149/15300 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 65301 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65301 steps, saw 26785 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10149 rows 2803 cols
[2022-06-08 12:33:45] [INFO ] Computed 52 place invariants in 728 ms
[2022-06-08 12:33:46] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2022-06-08 12:33:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 42 ms returned sat
[2022-06-08 12:33:51] [INFO ] After 4374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 12:33:51] [INFO ] State equation strengthened by 9997 read => feed constraints.
[2022-06-08 12:33:53] [INFO ] After 1889ms SMT Verify possible using 9997 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:33:53] [INFO ] After 7120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:33:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 35 ms returned sat
[2022-06-08 12:33:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 12:33:57] [INFO ] After 4177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 12:33:59] [INFO ] After 1982ms SMT Verify possible using 9997 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 12:34:00] [INFO ] After 2669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 448 ms.
[2022-06-08 12:34:00] [INFO ] After 7879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 18043 steps with 14 reset in 335 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-00 finished in 140724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 1105 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:34:04] [INFO ] Computed 52 place invariants in 1459 ms
[2022-06-08 12:34:05] [INFO ] Implicit Places using invariants in 2404 ms returned []
Implicit Place search using SMT only with invariants took 2406 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:34:06] [INFO ] Computed 52 place invariants in 1625 ms
[2022-06-08 12:34:07] [INFO ] Dead Transitions using invariants and state equation in 2443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s2310 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 79515 steps with 64 reset in 1282 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-01 finished in 7396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(X((p0 U p1)))||G(!p0))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 17 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7945 place count 2806 transition count 10152
Applied a total of 7945 rules in 3662 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:13] [INFO ] Computed 52 place invariants in 398 ms
[2022-06-08 12:34:14] [INFO ] Implicit Places using invariants in 1759 ms returned []
Implicit Place search using SMT only with invariants took 1760 ms to find 0 implicit places.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:15] [INFO ] Computed 52 place invariants in 552 ms
[2022-06-08 12:34:24] [INFO ] Dead Transitions using invariants and state equation in 9829 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5603 places, 10152/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2806/5603 places, 10152/15300 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1411 1), p1:(AND (GEQ s84 1) (GEQ s198 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 390 reset in 1752 ms.
Product exploration explored 100000 steps with 394 reset in 1871 ms.
Computed a total of 151 stabilizing places and 250 stable transitions
Computed a total of 151 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 8772 steps, including 35 resets, run visited all 4 properties in 236 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 469 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10152/10152 transitions.
Applied a total of 0 rules in 576 ms. Remains 2806 /2806 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:30] [INFO ] Computed 52 place invariants in 435 ms
[2022-06-08 12:34:31] [INFO ] Implicit Places using invariants in 1725 ms returned []
Implicit Place search using SMT only with invariants took 1726 ms to find 0 implicit places.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:32] [INFO ] Computed 52 place invariants in 390 ms
[2022-06-08 12:34:42] [INFO ] Dead Transitions using invariants and state equation in 10278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2806/2806 places, 10152/10152 transitions.
Computed a total of 151 stabilizing places and 250 stable transitions
Computed a total of 151 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Finished random walk after 3739 steps, including 14 resets, run visited all 4 properties in 128 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 490 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 395 reset in 1645 ms.
Product exploration explored 100000 steps with 394 reset in 1623 ms.
Built C files in :
/tmp/ltsmin2448921051106694987
[2022-06-08 12:34:46] [INFO ] Too many transitions (10152) to apply POR reductions. Disabling POR matrices.
[2022-06-08 12:34:47] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2448921051106694987
Running compilation step : cd /tmp/ltsmin2448921051106694987;'/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/ltsmin2448921051106694987;'/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/ltsmin2448921051106694987;'/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 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10152/10152 transitions.
Applied a total of 0 rules in 590 ms. Remains 2806 /2806 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:51] [INFO ] Computed 52 place invariants in 376 ms
[2022-06-08 12:34:52] [INFO ] Implicit Places using invariants in 1677 ms returned []
Implicit Place search using SMT only with invariants took 1678 ms to find 0 implicit places.
// Phase 1: matrix 10152 rows 2806 cols
[2022-06-08 12:34:52] [INFO ] Computed 52 place invariants in 411 ms
[2022-06-08 12:35:05] [INFO ] Dead Transitions using invariants and state equation in 13040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2806/2806 places, 10152/10152 transitions.
Built C files in :
/tmp/ltsmin7047671106898342989
[2022-06-08 12:35:05] [INFO ] Too many transitions (10152) to apply POR reductions. Disabling POR matrices.
[2022-06-08 12:35:05] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7047671106898342989
Running compilation step : cd /tmp/ltsmin7047671106898342989;'/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/ltsmin7047671106898342989;'/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/ltsmin7047671106898342989;'/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 12:35:09] [INFO ] Flatten gal took : 443 ms
[2022-06-08 12:35:10] [INFO ] Flatten gal took : 385 ms
[2022-06-08 12:35:10] [INFO ] Time to serialize gal into /tmp/LTL445321990978058167.gal : 168 ms
[2022-06-08 12:35:10] [INFO ] Time to serialize properties into /tmp/LTL14548044024073642444.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/LTL445321990978058167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14548044024073642444.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/LTL4453219...266
Read 1 LTL properties
Checking formula 0 : !((F(X(G((G(X(("(Node22GiveAnswer5>=1)")U("((Node13Request>=1)&&(Node32IsInserted>=1))"))))||(G("(Node22GiveAnswer5<1)")))))))
Formula 0 simplified : !FXG(GX("(Node22GiveAnswer5>=1)" U "((Node13Request>=1)&&(Node32IsInserted>=1))") | G"(Node22GiveAnswer5<1)")
Detected timeout of ITS tools.
[2022-06-08 12:35:26] [INFO ] Flatten gal took : 491 ms
[2022-06-08 12:35:26] [INFO ] Applying decomposition
[2022-06-08 12:35:26] [INFO ] Flatten gal took : 412 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/graph388345879984463738.txt' '-o' '/tmp/graph388345879984463738.bin' '-w' '/tmp/graph388345879984463738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph388345879984463738.bin' '-l' '-1' '-v' '-w' '/tmp/graph388345879984463738.weights' '-q' '0' '-e' '0.001'
[2022-06-08 12:35:27] [INFO ] Decomposing Gal with order
[2022-06-08 12:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 12:35:30] [INFO ] Removed a total of 7530 redundant transitions.
[2022-06-08 12:35:31] [INFO ] Flatten gal took : 2892 ms
[2022-06-08 12:35:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 5000 labels/synchronizations in 1401 ms.
[2022-06-08 12:35:32] [INFO ] Time to serialize gal into /tmp/LTL11228684534222112737.gal : 66 ms
[2022-06-08 12:35:32] [INFO ] Time to serialize properties into /tmp/LTL11590141567605312764.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/LTL11228684534222112737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11590141567605312764.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/LTL1122868...247
Read 1 LTL properties
Checking formula 0 : !((F(X(G((G(X(("(u6.Node22GiveAnswer5>=1)")U("((i14.u15.Node13Request>=1)&&(u34.Node32IsInserted>=1))"))))||(G("(u6.Node22GiveAnswer5<...165
Formula 0 simplified : !FXG(GX("(u6.Node22GiveAnswer5>=1)" U "((i14.u15.Node13Request>=1)&&(u34.Node32IsInserted>=1))") | G"(u6.Node22GiveAnswer5<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12988822575247483950
[2022-06-08 12:35:48] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12988822575247483950
Running compilation step : cd /tmp/ltsmin12988822575247483950;'/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/ltsmin12988822575247483950;'/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/ltsmin12988822575247483950;'/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-050-LTLFireability-02 finished in 102015 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||(F(G((G(X(p2))&&p1)))&&p2))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 5603 transition count 15004
Reduce places removed 296 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 347 rules applied. Total rules applied 643 place count 5307 transition count 14953
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 694 place count 5256 transition count 14952
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 11 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 3 with 4896 rules applied. Total rules applied 5592 place count 2807 transition count 12504
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 3 with 2352 rules applied. Total rules applied 7944 place count 2807 transition count 10152
Applied a total of 7944 rules in 4727 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2807 cols
[2022-06-08 12:35:56] [INFO ] Computed 52 place invariants in 564 ms
[2022-06-08 12:35:57] [INFO ] Implicit Places using invariants in 2017 ms returned []
Implicit Place search using SMT only with invariants took 2018 ms to find 0 implicit places.
// Phase 1: matrix 10152 rows 2807 cols
[2022-06-08 12:35:58] [INFO ] Computed 52 place invariants in 524 ms
[2022-06-08 12:36:10] [INFO ] Dead Transitions using invariants and state equation in 12536 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2807/5603 places, 10152/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2807/5603 places, 10152/15300 transitions.
Stuttering acceptance computed with spot in 55 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s216 1) (GEQ s246 1)), p1:(AND (GEQ s2 1) (GEQ s69 1)), p2:(GEQ s266 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 265 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-04 finished in 19399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||!(F(p1) U !p2)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 10 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 2 with 4894 rules applied. Total rules applied 5592 place count 2807 transition count 12504
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 2 with 2349 rules applied. Total rules applied 7941 place count 2807 transition count 10155
Applied a total of 7941 rules in 4261 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10155/15300 (removed 5145) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2022-06-08 12:36:15] [INFO ] Computed 52 place invariants in 487 ms
[2022-06-08 12:36:16] [INFO ] Implicit Places using invariants in 1851 ms returned []
Implicit Place search using SMT only with invariants took 1854 ms to find 0 implicit places.
// Phase 1: matrix 10155 rows 2807 cols
[2022-06-08 12:36:17] [INFO ] Computed 52 place invariants in 531 ms
[2022-06-08 12:36:27] [INFO ] Dead Transitions using invariants and state equation in 10557 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2807/5603 places, 10155/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2807/5603 places, 10155/15300 transitions.
Stuttering acceptance computed with spot in 371 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p1 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (OR (LT s53 1) (LT s661 1)) (LT s2435 1)), p2:(OR (GEQ s2626 1) (GEQ s1313 1)), p1:(GEQ s2626 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2207 steps with 8 reset in 73 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-05 finished in 17160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 12 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Applied a total of 7950 rules in 4530 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10149/15300 (removed 5151) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:36:32] [INFO ] Computed 52 place invariants in 485 ms
[2022-06-08 12:36:33] [INFO ] Implicit Places using invariants in 1653 ms returned []
Implicit Place search using SMT only with invariants took 1654 ms to find 0 implicit places.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:36:34] [INFO ] Computed 52 place invariants in 439 ms
[2022-06-08 12:36:42] [INFO ] Dead Transitions using invariants and state equation in 8092 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10149/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/5603 places, 10149/15300 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s89 1) (GEQ s1968 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 258 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-06 finished in 14363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 9 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Applied a total of 7950 rules in 3486 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10149/15300 (removed 5151) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:36:46] [INFO ] Computed 52 place invariants in 434 ms
[2022-06-08 12:36:47] [INFO ] Implicit Places using invariants in 1543 ms returned []
Implicit Place search using SMT only with invariants took 1546 ms to find 0 implicit places.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:36:47] [INFO ] Computed 52 place invariants in 499 ms
[2022-06-08 12:36:54] [INFO ] Dead Transitions using invariants and state equation in 7351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10149/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/5603 places, 10149/15300 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-07 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:(OR (LT s53 1) (LT s411 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]]
Product exploration explored 100000 steps with 398 reset in 2101 ms.
Product exploration explored 100000 steps with 401 reset in 2149 ms.
Computed a total of 154 stabilizing places and 251 stable transitions
Computed a total of 154 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2475 steps, including 9 resets, run visited all 1 properties in 58 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 315 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 10149/10149 transitions.
Applied a total of 0 rules in 717 ms. Remains 2804 /2804 variables (removed 0) and now considering 10149/10149 (removed 0) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:37:01] [INFO ] Computed 52 place invariants in 536 ms
[2022-06-08 12:37:02] [INFO ] Implicit Places using invariants in 1834 ms returned []
Implicit Place search using SMT only with invariants took 1839 ms to find 0 implicit places.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:37:03] [INFO ] Computed 52 place invariants in 516 ms
[2022-06-08 12:37:13] [INFO ] Dead Transitions using invariants and state equation in 11344 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/2804 places, 10149/10149 transitions.
Computed a total of 154 stabilizing places and 251 stable transitions
Computed a total of 154 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62460 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62460 steps, saw 28673 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:37:18] [INFO ] Computed 52 place invariants in 566 ms
[2022-06-08 12:37:18] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2022-06-08 12:37:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 12:37:23] [INFO ] After 5031ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-08 12:37:23] [INFO ] State equation strengthened by 7448 read => feed constraints.
[2022-06-08 12:37:25] [INFO ] After 1247ms SMT Verify possible using 7448 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:37:25] [INFO ] After 7015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-08 12:37:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2022-06-08 12:37:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 48 ms returned sat
[2022-06-08 12:37:30] [INFO ] After 4813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-08 12:37:31] [INFO ] After 1238ms SMT Verify possible using 7448 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-08 12:37:32] [INFO ] After 1834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 497 ms.
[2022-06-08 12:37:32] [INFO ] After 7735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 37 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 400 reset in 1988 ms.
Product exploration explored 100000 steps with 397 reset in 1831 ms.
Built C files in :
/tmp/ltsmin203510570959679574
[2022-06-08 12:37:37] [INFO ] Too many transitions (10149) to apply POR reductions. Disabling POR matrices.
[2022-06-08 12:37:37] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin203510570959679574
Running compilation step : cd /tmp/ltsmin203510570959679574;'/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/ltsmin203510570959679574;'/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/ltsmin203510570959679574;'/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 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 10149/10149 transitions.
Applied a total of 0 rules in 613 ms. Remains 2804 /2804 variables (removed 0) and now considering 10149/10149 (removed 0) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:37:41] [INFO ] Computed 52 place invariants in 403 ms
[2022-06-08 12:37:42] [INFO ] Implicit Places using invariants in 1556 ms returned []
Implicit Place search using SMT only with invariants took 1561 ms to find 0 implicit places.
// Phase 1: matrix 10149 rows 2804 cols
[2022-06-08 12:37:43] [INFO ] Computed 52 place invariants in 418 ms
[2022-06-08 12:37:50] [INFO ] Dead Transitions using invariants and state equation in 8357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2804/2804 places, 10149/10149 transitions.
Built C files in :
/tmp/ltsmin15674793441923540285
[2022-06-08 12:37:50] [INFO ] Too many transitions (10149) to apply POR reductions. Disabling POR matrices.
[2022-06-08 12:37:51] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15674793441923540285
Running compilation step : cd /tmp/ltsmin15674793441923540285;'/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/ltsmin15674793441923540285;'/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/ltsmin15674793441923540285;'/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 12:37:55] [INFO ] Flatten gal took : 508 ms
[2022-06-08 12:37:55] [INFO ] Flatten gal took : 354 ms
[2022-06-08 12:37:55] [INFO ] Time to serialize gal into /tmp/LTL7744604327834777726.gal : 64 ms
[2022-06-08 12:37:55] [INFO ] Time to serialize properties into /tmp/LTL12187486505076584185.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/LTL7744604327834777726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12187486505076584185.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/LTL7744604...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node8IsInserted<1)||(Node2requestsent8<1))"))))
Formula 0 simplified : !GF"((Node8IsInserted<1)||(Node2requestsent8<1))"
Detected timeout of ITS tools.
[2022-06-08 12:38:10] [INFO ] Flatten gal took : 370 ms
[2022-06-08 12:38:10] [INFO ] Applying decomposition
[2022-06-08 12:38:11] [INFO ] Flatten gal took : 334 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/graph13360644269049334198.txt' '-o' '/tmp/graph13360644269049334198.bin' '-w' '/tmp/graph13360644269049334198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13360644269049334198.bin' '-l' '-1' '-v' '-w' '/tmp/graph13360644269049334198.weights' '-q' '0' '-e' '0.001'
[2022-06-08 12:38:12] [INFO ] Decomposing Gal with order
[2022-06-08 12:38:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 12:38:13] [INFO ] Removed a total of 7515 redundant transitions.
[2022-06-08 12:38:14] [INFO ] Flatten gal took : 1576 ms
[2022-06-08 12:38:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4901 labels/synchronizations in 967 ms.
[2022-06-08 12:38:15] [INFO ] Time to serialize gal into /tmp/LTL7296191538202881927.gal : 131 ms
[2022-06-08 12:38:15] [INFO ] Time to serialize properties into /tmp/LTL14148921442586689020.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/LTL7296191538202881927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14148921442586689020.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/LTL7296191...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((u9.Node8IsInserted<1)||(u3.Node2requestsent8<1))"))))
Formula 0 simplified : !GF"((u9.Node8IsInserted<1)||(u3.Node2requestsent8<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4625204227112459991
[2022-06-08 12:38:30] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4625204227112459991
Running compilation step : cd /tmp/ltsmin4625204227112459991;'/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/ltsmin4625204227112459991;'/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/ltsmin4625204227112459991;'/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-050-LTLFireability-07 finished in 111538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(G(p0)))||(F(G(p1)) U p2))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 842 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:38:36] [INFO ] Computed 52 place invariants in 1572 ms
[2022-06-08 12:38:36] [INFO ] Implicit Places using invariants in 2351 ms returned []
Implicit Place search using SMT only with invariants took 2354 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:38:38] [INFO ] Computed 52 place invariants in 1516 ms
[2022-06-08 12:38:39] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s2926 1), p0:(GEQ s1450 1), p1:(GEQ s1350 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1179 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-08 finished in 5763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(p1)&&p0)))||(p2 U !(X(p3)||X(p2)))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 851 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:38:42] [INFO ] Computed 52 place invariants in 1974 ms
[2022-06-08 12:38:43] [INFO ] Implicit Places using invariants in 2757 ms returned []
Implicit Place search using SMT only with invariants took 2758 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:38:44] [INFO ] Computed 52 place invariants in 1752 ms
[2022-06-08 12:38:45] [INFO ] Dead Transitions using invariants and state equation in 2565 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 400 ms :[true, (OR (AND (NOT p0) p3) (AND (NOT p1) p3) (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2) (AND (NOT p1) p3) (AND (NOT p0) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3) (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (NOT p1) (NOT p0)), (OR p3 p2), (OR p3 p2)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1 p2) (AND p0 p1 p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0} source=5 dest: 6}], [{ cond=(OR p2 p3), acceptance={} source=6 dest: 0}]], initial=1, aps=[p2:(GEQ s4834 1), p0:(AND (GEQ s273 1) (GEQ s348 1)), p3:(AND (GEQ s413 1) (GEQ s5171 1)), p1:(AND (GEQ s273 1) (GEQ s348 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6402 ms.
Product exploration explored 100000 steps with 50000 reset in 6201 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (OR (AND p0 p1 p2) (AND p0 p1 p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND p0 p1 p2) (AND p0 p1 p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p1) p2) (AND (NOT p1) p3))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3) (AND (NOT p1) p2) (AND (NOT p1) p3))))
Knowledge based reduction with 19 factoid took 370 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-09 finished in 19646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(X(p0) U p1)&&p2) U (G(!p2)&&p1)))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 5 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 2 with 4894 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 2 with 2349 rules applied. Total rules applied 7943 place count 2806 transition count 10154
Applied a total of 7943 rules in 3552 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10154/15300 (removed 5146) transitions.
// Phase 1: matrix 10154 rows 2806 cols
[2022-06-08 12:39:03] [INFO ] Computed 52 place invariants in 401 ms
[2022-06-08 12:39:04] [INFO ] Implicit Places using invariants in 1472 ms returned []
Implicit Place search using SMT only with invariants took 1473 ms to find 0 implicit places.
// Phase 1: matrix 10154 rows 2806 cols
[2022-06-08 12:39:04] [INFO ] Computed 52 place invariants in 466 ms
[2022-06-08 12:39:11] [INFO ] Dead Transitions using invariants and state equation in 7810 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5603 places, 10154/15300 transitions.
Finished structural reductions, in 1 iterations. Remains : 2806/5603 places, 10154/15300 transitions.
Stuttering acceptance computed with spot in 160 ms :[p2, true, (OR (NOT p1) p2), (OR (NOT p1) p0 p2)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p1 p2) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LT s377 1), p1:(GEQ s484 1), p0:(GEQ s1950 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 253 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-10 finished in 13060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 1005 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:14] [INFO ] Computed 52 place invariants in 1694 ms
[2022-06-08 12:39:15] [INFO ] Implicit Places using invariants in 2473 ms returned []
Implicit Place search using SMT only with invariants took 2475 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:17] [INFO ] Computed 52 place invariants in 1721 ms
[2022-06-08 12:39:18] [INFO ] Dead Transitions using invariants and state equation in 2529 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s483 1) (LT s656 1) (GEQ s1658 1)), p1:(GEQ s1285 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-11 finished in 6296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(F(p0))&&G(X(G(p0))))||p1)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 1162 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:21] [INFO ] Computed 52 place invariants in 1667 ms
[2022-06-08 12:39:22] [INFO ] Implicit Places using invariants in 2489 ms returned []
Implicit Place search using SMT only with invariants took 2490 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:23] [INFO ] Computed 52 place invariants in 1782 ms
[2022-06-08 12:39:24] [INFO ] Dead Transitions using invariants and state equation in 2615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s7 1) (LT s656 1)) (OR (LT s105 1) (LT s502 1))), p0:(GEQ s4371 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 804 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-13 finished in 6460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0)) U p2)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 1271 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:28] [INFO ] Computed 52 place invariants in 1820 ms
[2022-06-08 12:39:28] [INFO ] Implicit Places using invariants in 2651 ms returned []
Implicit Place search using SMT only with invariants took 2653 ms to find 0 implicit places.
// Phase 1: matrix 15300 rows 5603 cols
[2022-06-08 12:39:30] [INFO ] Computed 52 place invariants in 1827 ms
[2022-06-08 12:39:31] [INFO ] Dead Transitions using invariants and state equation in 2660 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s4976 1), p0:(AND (GEQ s376 1) (GEQ s623 1)), p1:(AND (GEQ s693 1) (GEQ s1779 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1349 steps with 0 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-14 finished in 6987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((G(X((p0 U p1)))||G(!p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-06-08 12:39:32] [INFO ] Flatten gal took : 553 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6808965158183713852
[2022-06-08 12:39:33] [INFO ] Too many transitions (15300) to apply POR reductions. Disabling POR matrices.
[2022-06-08 12:39:33] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6808965158183713852
Running compilation step : cd /tmp/ltsmin6808965158183713852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 12:39:33] [INFO ] Applying decomposition
[2022-06-08 12:39:34] [INFO ] Flatten gal took : 786 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/graph16802236583534804056.txt' '-o' '/tmp/graph16802236583534804056.bin' '-w' '/tmp/graph16802236583534804056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16802236583534804056.bin' '-l' '-1' '-v' '-w' '/tmp/graph16802236583534804056.weights' '-q' '0' '-e' '0.001'
[2022-06-08 12:39:36] [INFO ] Decomposing Gal with order
[2022-06-08 12:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 12:39:39] [INFO ] Removed a total of 7524 redundant transitions.
[2022-06-08 12:39:39] [INFO ] Flatten gal took : 2206 ms
[2022-06-08 12:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 9794 labels/synchronizations in 1571 ms.
[2022-06-08 12:39:41] [INFO ] Time to serialize gal into /tmp/LTLFireability14622665936656427719.gal : 130 ms
[2022-06-08 12:39:41] [INFO ] Time to serialize properties into /tmp/LTLFireability18310222050761719274.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/LTLFireability14622665936656427719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18310222050761719274.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...269
Read 2 LTL properties
Checking formula 0 : !((F(X(G((G(X(("(i7.u23.Node22GiveAnswer5>=1)")U("((i17.u55.Node13Request>=1)&&(i44.u128.Node32IsInserted>=1))"))))||(G("(i7.u23.Node2...178
Formula 0 simplified : !FXG(GX("(i7.u23.Node22GiveAnswer5>=1)" U "((i17.u55.Node13Request>=1)&&(i44.u128.Node32IsInserted>=1))") | G"(i7.u23.Node22GiveAnsw...163
Compilation finished in 220291 ms.
Running link step : cd /tmp/ltsmin6808965158183713852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 182 ms.
Running LTSmin : cd /tmp/ltsmin6808965158183713852;'/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(((LTLAPp0==true) U (LTLAPp1==true))))||[](!(LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 625009 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin6808965158183713852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-08 13:02:47] [INFO ] Flatten gal took : 1114 ms
[2022-06-08 13:02:47] [INFO ] Time to serialize gal into /tmp/LTLFireability4147972114354954641.gal : 122 ms
[2022-06-08 13:02:47] [INFO ] Time to serialize properties into /tmp/LTLFireability3166596613975342628.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/LTLFireability4147972114354954641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3166596613975342628.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/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node8IsInserted<1)||(Node2requestsent8<1))"))))
Formula 0 simplified : !GF"((Node8IsInserted<1)||(Node2requestsent8<1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6808965158183713852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6808965158183713852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-08 13:25:53] [INFO ] Flatten gal took : 1138 ms
[2022-06-08 13:25:54] [INFO ] Input system was already deterministic with 15300 transitions.
[2022-06-08 13:25:54] [INFO ] Transformed 5603 places.
[2022-06-08 13:25:55] [INFO ] Transformed 15300 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-08 13:26:28] [INFO ] Time to serialize gal into /tmp/LTLFireability5666859978278629058.gal : 151 ms
[2022-06-08 13:26:28] [INFO ] Time to serialize properties into /tmp/LTLFireability10139372236020957456.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/LTLFireability5666859978278629058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10139372236020957456.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((Node8IsInserted<1)||(Node2requestsent8<1))"))))
Formula 0 simplified : !GF"((Node8IsInserted<1)||(Node2requestsent8<1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-050"
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-050, 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-165463872300044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 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 '
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 ;