Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690800732.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:22 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-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678377052077

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 15:50:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:50:54] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2023-03-09 15:50:54] [INFO ] Transformed 3684 places.
[2023-03-09 15:50:54] [INFO ] Transformed 9840 transitions.
[2023-03-09 15:50:54] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 559 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:50:55] [INFO ] Computed 42 place invariants in 521 ms
[2023-03-09 15:50:56] [INFO ] Implicit Places using invariants in 1363 ms returned []
[2023-03-09 15:50:56] [INFO ] Invariant cache hit.
[2023-03-09 15:50:59] [INFO ] Implicit Places using invariants and state equation in 2750 ms returned []
Implicit Place search using SMT with State Equation took 4154 ms to find 0 implicit places.
[2023-03-09 15:50:59] [INFO ] Invariant cache hit.
[2023-03-09 15:51:04] [INFO ] Dead Transitions using invariants and state equation in 5247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9968 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 38 out of 3683 places after structural reductions.
[2023-03-09 15:51:04] [INFO ] Flatten gal took : 335 ms
[2023-03-09 15:51:05] [INFO ] Flatten gal took : 237 ms
[2023-03-09 15:51:05] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 15:51:06] [INFO ] Invariant cache hit.
[2023-03-09 15:51:07] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2023-03-09 15:51:07] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-09 15:51:15] [INFO ] After 7131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2023-03-09 15:51:15] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 15:51:21] [INFO ] After 6255ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 15:51:21] [INFO ] After 15099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 15:51:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2023-03-09 15:51:22] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 51 ms returned sat
[2023-03-09 15:51:30] [INFO ] After 7487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-09 15:51:46] [INFO ] After 15944ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-09 15:51:46] [INFO ] After 15945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 15:51:46] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 243 ms.
Support contains 12 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 3406 transition count 9563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 554 place count 3406 transition count 9562
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1553 Post agglomeration using F-continuation condition.Transition count delta: 1553
Deduced a syphon composed of 1553 places in 6 ms
Reduce places removed 1553 places and 0 transitions.
Iterating global reduction 2 with 3106 rules applied. Total rules applied 3662 place count 1852 transition count 8009
Drop transitions removed 1476 transitions
Redundant transition composition rules discarded 1476 transitions
Iterating global reduction 2 with 1476 rules applied. Total rules applied 5138 place count 1852 transition count 6533
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5141 place count 1852 transition count 6530
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 5144 place count 1849 transition count 6530
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6783 place count 1849 transition count 6530
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 6823 place count 1849 transition count 6530
Applied a total of 6823 rules in 1975 ms. Remains 1849 /3683 variables (removed 1834) and now considering 6530/9840 (removed 3310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1976 ms. Remains : 1849/3683 places, 6530/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 6530 rows 1849 cols
[2023-03-09 15:51:49] [INFO ] Computed 42 place invariants in 208 ms
[2023-03-09 15:51:49] [INFO ] [Real]Absence check using 40 positive place invariants in 30 ms returned sat
[2023-03-09 15:51:49] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 33 ms returned sat
[2023-03-09 15:51:51] [INFO ] After 1451ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 15:51:51] [INFO ] State equation strengthened by 6389 read => feed constraints.
[2023-03-09 15:51:52] [INFO ] After 796ms SMT Verify possible using 6389 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:51:52] [INFO ] After 2655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:51:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2023-03-09 15:51:52] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 37 ms returned sat
[2023-03-09 15:51:55] [INFO ] After 2536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:51:55] [INFO ] After 779ms SMT Verify possible using 6389 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:51:56] [INFO ] After 1167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-09 15:51:56] [INFO ] After 4309ms 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 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 257 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:51:58] [INFO ] Computed 42 place invariants in 579 ms
[2023-03-09 15:51:58] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2023-03-09 15:51:58] [INFO ] Invariant cache hit.
[2023-03-09 15:52:01] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 4516 ms to find 0 implicit places.
[2023-03-09 15:52:01] [INFO ] Invariant cache hit.
[2023-03-09 15:52:07] [INFO ] Dead Transitions using invariants and state equation in 5084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9861 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1086 steps with 0 reset in 62 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 10343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 185 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-09 15:52:07] [INFO ] Invariant cache hit.
[2023-03-09 15:52:10] [INFO ] Implicit Places using invariants in 2455 ms returned []
[2023-03-09 15:52:10] [INFO ] Invariant cache hit.
[2023-03-09 15:52:14] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 6301 ms to find 0 implicit places.
[2023-03-09 15:52:14] [INFO ] Invariant cache hit.
[2023-03-09 15:52:20] [INFO ] Dead Transitions using invariants and state equation in 6771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13259 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 490 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LT s187 1), p0:(OR (GEQ s3458 1) (LT s812 1)), p2:(GEQ s3248 1), p1:(GEQ s3458 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 104 reset in 1168 ms.
Product exploration explored 100000 steps with 103 reset in 971 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p1)))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 2311 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 15:52:26] [INFO ] Invariant cache hit.
[2023-03-09 15:52:27] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned sat
[2023-03-09 15:52:27] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-09 15:52:33] [INFO ] After 5631ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:5
[2023-03-09 15:52:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 15:52:34] [INFO ] After 716ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :3 sat :0 real:6
[2023-03-09 15:52:34] [INFO ] After 7277ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2023-03-09 15:52:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 31 ms returned sat
[2023-03-09 15:52:34] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-09 15:52:40] [INFO ] After 4984ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-09 15:52:55] [INFO ] After 15067ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-09 15:52:58] [INFO ] After 18512ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-09 15:52:59] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 4 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1431 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1432 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-09 15:53:01] [INFO ] Computed 42 place invariants in 210 ms
[2023-03-09 15:53:01] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2023-03-09 15:53:01] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-09 15:53:03] [INFO ] After 1989ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:53:03] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:53:05] [INFO ] After 1225ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:53:05] [INFO ] After 3670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:53:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-09 15:53:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-09 15:53:07] [INFO ] After 2216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:53:09] [INFO ] After 1880ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:53:10] [INFO ] After 2944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 728 ms.
[2023-03-09 15:53:11] [INFO ] After 6313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 197 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 106734 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106734 steps, saw 27069 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:53:14] [INFO ] Invariant cache hit.
[2023-03-09 15:53:15] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-09 15:53:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-09 15:53:17] [INFO ] After 1968ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:53:17] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:53:18] [INFO ] After 1093ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:53:18] [INFO ] After 3493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:53:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-09 15:53:18] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-09 15:53:21] [INFO ] After 2314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:53:23] [INFO ] After 1917ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:53:24] [INFO ] After 2946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 721 ms.
[2023-03-09 15:53:24] [INFO ] After 6412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 216 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 208 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-09 15:53:25] [INFO ] Invariant cache hit.
[2023-03-09 15:53:27] [INFO ] Implicit Places using invariants in 1907 ms returned []
[2023-03-09 15:53:27] [INFO ] Invariant cache hit.
[2023-03-09 15:53:28] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:53:38] [INFO ] Implicit Places using invariants and state equation in 11262 ms returned []
Implicit Place search using SMT with State Equation took 13174 ms to find 0 implicit places.
[2023-03-09 15:53:39] [INFO ] Redundant transitions in 570 ms returned []
[2023-03-09 15:53:39] [INFO ] Invariant cache hit.
[2023-03-09 15:53:41] [INFO ] Dead Transitions using invariants and state equation in 2701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16667 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 5 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.0 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 24 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-09 15:53:41] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 15:53:41] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:53:41] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:53:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:53:41] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:53:41] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:53:41] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p1)))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p0) p3 (NOT p1) (NOT p2))), (F (NOT p3)), (F (AND p3 p1 (NOT p2))), (F (NOT (AND p3 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Knowledge based reduction with 26 factoid took 1678 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 298 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:53:45] [INFO ] Computed 42 place invariants in 574 ms
[2023-03-09 15:53:47] [INFO ] Implicit Places using invariants in 2748 ms returned []
[2023-03-09 15:53:47] [INFO ] Invariant cache hit.
[2023-03-09 15:53:50] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 5834 ms to find 0 implicit places.
[2023-03-09 15:53:50] [INFO ] Invariant cache hit.
[2023-03-09 15:53:54] [INFO ] Dead Transitions using invariants and state equation in 4329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10465 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 17 factoid took 1168 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :4
Running SMT prover for 5 properties.
[2023-03-09 15:53:56] [INFO ] Invariant cache hit.
[2023-03-09 15:53:57] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2023-03-09 15:53:57] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-09 15:54:03] [INFO ] After 5566ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-09 15:54:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-09 15:54:03] [INFO ] After 680ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:54:03] [INFO ] After 6980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:54:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2023-03-09 15:54:04] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 50 ms returned sat
[2023-03-09 15:54:09] [INFO ] After 4369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:54:22] [INFO ] After 13512ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 15:54:25] [INFO ] After 16778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1736 ms.
[2023-03-09 15:54:27] [INFO ] After 23889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 4 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1490 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1494 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-09 15:54:29] [INFO ] Computed 42 place invariants in 279 ms
[2023-03-09 15:54:30] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-09 15:54:30] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-09 15:54:31] [INFO ] After 1798ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:54:32] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:54:33] [INFO ] After 1214ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:54:33] [INFO ] After 3457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:54:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-09 15:54:33] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-09 15:54:36] [INFO ] After 2375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:54:37] [INFO ] After 1772ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:54:39] [INFO ] After 3059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 982 ms.
[2023-03-09 15:54:40] [INFO ] After 6783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 255 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 104598 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104598 steps, saw 26829 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:54:43] [INFO ] Invariant cache hit.
[2023-03-09 15:54:44] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-09 15:54:44] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-09 15:54:46] [INFO ] After 1967ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:54:46] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:54:47] [INFO ] After 1045ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:54:47] [INFO ] After 3503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:54:47] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-09 15:54:47] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-09 15:54:49] [INFO ] After 2309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:54:51] [INFO ] After 1723ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:54:52] [INFO ] After 2766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 715 ms.
[2023-03-09 15:54:53] [INFO ] After 6176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 216 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 213 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-09 15:54:53] [INFO ] Invariant cache hit.
[2023-03-09 15:54:55] [INFO ] Implicit Places using invariants in 2049 ms returned []
[2023-03-09 15:54:55] [INFO ] Invariant cache hit.
[2023-03-09 15:54:56] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-09 15:55:07] [INFO ] Implicit Places using invariants and state equation in 12053 ms returned []
Implicit Place search using SMT with State Equation took 14117 ms to find 0 implicit places.
[2023-03-09 15:55:08] [INFO ] Redundant transitions in 606 ms returned []
[2023-03-09 15:55:08] [INFO ] Invariant cache hit.
[2023-03-09 15:55:11] [INFO ] Dead Transitions using invariants and state equation in 2686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17650 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.0 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 18 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-09 15:55:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:55:11] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:55:11] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:55:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-09 15:55:11] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:55:11] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:55:11] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2))), (F (AND p1 p3 (NOT p2))), (F (NOT (AND (NOT p1) p3 (NOT p2)))), (F (AND p3 (NOT p2) (NOT p0))), (F (NOT p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 17 factoid took 1198 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 103 reset in 1029 ms.
Product exploration explored 100000 steps with 106 reset in 974 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 199 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 3 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1596 Post agglomeration using F-continuation condition.Transition count delta: -3034
Deduced a syphon composed of 1755 places in 4 ms
Iterating global reduction 1 with 1596 rules applied. Total rules applied 1995 place count 3603 transition count 12794
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 2153 place count 3445 transition count 12636
Deduced a syphon composed of 1597 places in 2 ms
Iterating global reduction 1 with 158 rules applied. Total rules applied 2311 place count 3445 transition count 12636
Deduced a syphon composed of 1597 places in 3 ms
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 1 with 1479 rules applied. Total rules applied 3790 place count 3445 transition count 11157
Deduced a syphon composed of 1597 places in 2 ms
Applied a total of 3790 rules in 2799 ms. Remains 3445 /3683 variables (removed 238) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3445 cols
[2023-03-09 15:55:19] [INFO ] Computed 42 place invariants in 529 ms
[2023-03-09 15:55:23] [INFO ] Dead Transitions using invariants and state equation in 5075 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3445/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7877 ms. Remains : 3445/3683 places, 11157/9840 transitions.
Built C files in :
/tmp/ltsmin16726865420832163566
[2023-03-09 15:55:23] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16726865420832163566
Running compilation step : cd /tmp/ltsmin16726865420832163566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16726865420832163566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16726865420832163566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 308 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:55:27] [INFO ] Computed 42 place invariants in 441 ms
[2023-03-09 15:55:28] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2023-03-09 15:55:28] [INFO ] Invariant cache hit.
[2023-03-09 15:55:30] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2023-03-09 15:55:30] [INFO ] Invariant cache hit.
[2023-03-09 15:55:35] [INFO ] Dead Transitions using invariants and state equation in 4704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8151 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Built C files in :
/tmp/ltsmin8293708604921125479
[2023-03-09 15:55:35] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8293708604921125479
Running compilation step : cd /tmp/ltsmin8293708604921125479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8293708604921125479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8293708604921125479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:55:39] [INFO ] Flatten gal took : 261 ms
[2023-03-09 15:55:39] [INFO ] Flatten gal took : 213 ms
[2023-03-09 15:55:39] [INFO ] Time to serialize gal into /tmp/LTL11399724021568887308.gal : 101 ms
[2023-03-09 15:55:39] [INFO ] Time to serialize properties into /tmp/LTL6990991331831256704.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11399724021568887308.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12242814713405854675.hoa' '-atoms' '/tmp/LTL6990991331831256704.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6990991331831256704.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12242814713405854675.hoa
Detected timeout of ITS tools.
[2023-03-09 15:55:55] [INFO ] Flatten gal took : 242 ms
[2023-03-09 15:55:55] [INFO ] Flatten gal took : 281 ms
[2023-03-09 15:55:55] [INFO ] Time to serialize gal into /tmp/LTL4389293883991263880.gal : 42 ms
[2023-03-09 15:55:55] [INFO ] Time to serialize properties into /tmp/LTL14879437937974295669.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4389293883991263880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14879437937974295669.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
Detected timeout of ITS tools.
[2023-03-09 15:56:10] [INFO ] Flatten gal took : 268 ms
[2023-03-09 15:56:10] [INFO ] Applying decomposition
[2023-03-09 15:56:10] [INFO ] Flatten gal took : 258 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1321793240318187711.txt' '-o' '/tmp/graph1321793240318187711.bin' '-w' '/tmp/graph1321793240318187711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1321793240318187711.bin' '-l' '-1' '-v' '-w' '/tmp/graph1321793240318187711.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:56:11] [INFO ] Decomposing Gal with order
[2023-03-09 15:56:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:56:12] [INFO ] Removed a total of 4820 redundant transitions.
[2023-03-09 15:56:12] [INFO ] Flatten gal took : 864 ms
[2023-03-09 15:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4372 labels/synchronizations in 351 ms.
[2023-03-09 15:56:13] [INFO ] Time to serialize gal into /tmp/LTL4635719452972066198.gal : 50 ms
[2023-03-09 15:56:13] [INFO ] Time to serialize properties into /tmp/LTL15516586116777190386.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4635719452972066198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15516586116777190386.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("((u18.Node37GiveAnswer4>=1)||(u35.Node3GiveAnswer8<1))")))U((X(("(u18.Node37GiveAnswer4>=1)")U("(u67.Node34GiveAnswer16>=1)")...189
Formula 0 simplified : FG!"((u18.Node37GiveAnswer4>=1)||(u35.Node3GiveAnswer8<1))" R (X(!"(u18.Node37GiveAnswer4>=1)" R !"(u67.Node34GiveAnswer16>=1)") & F...179
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9659172058907960905
[2023-03-09 15:56:28] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9659172058907960905
Running compilation step : cd /tmp/ltsmin9659172058907960905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9659172058907960905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9659172058907960905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 264007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X((G(F(p1)) U G(p2))))))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 281 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-09 15:56:31] [INFO ] Invariant cache hit.
[2023-03-09 15:56:33] [INFO ] Implicit Places using invariants in 2035 ms returned []
[2023-03-09 15:56:33] [INFO ] Invariant cache hit.
[2023-03-09 15:56:36] [INFO ] Implicit Places using invariants and state equation in 2845 ms returned []
Implicit Place search using SMT with State Equation took 4883 ms to find 0 implicit places.
[2023-03-09 15:56:36] [INFO ] Invariant cache hit.
[2023-03-09 15:56:40] [INFO ] Dead Transitions using invariants and state equation in 4114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9279 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 624 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(NOT p0), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=p0, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (GEQ s2302 1) (GEQ s1730 1)), p2:(AND (GEQ s413 1) (GEQ s853 1)), p1:(AND (GEQ s223 1) (GEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 965 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-04 finished in 10001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0)&&F(p1))||(p2&&G(p3)))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 289 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-09 15:56:41] [INFO ] Invariant cache hit.
[2023-03-09 15:56:42] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-09 15:56:42] [INFO ] Invariant cache hit.
[2023-03-09 15:56:43] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-09 15:56:43] [INFO ] Invariant cache hit.
[2023-03-09 15:56:48] [INFO ] Dead Transitions using invariants and state equation in 4573 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6560 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p0)), true, (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s1444 1), p3:(GEQ s2534 1), p1:(GEQ s1895 1), p0:(GEQ s804 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 6783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1||X((X((F(!p2)||X(G(!p3)))) U (p1&&X((F(!p2)||X(G(!p3)))))))))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 257 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-09 15:56:48] [INFO ] Invariant cache hit.
[2023-03-09 15:56:49] [INFO ] Implicit Places using invariants in 933 ms returned []
[2023-03-09 15:56:49] [INFO ] Invariant cache hit.
[2023-03-09 15:56:51] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2023-03-09 15:56:51] [INFO ] Invariant cache hit.
[2023-03-09 15:56:55] [INFO ] Dead Transitions using invariants and state equation in 4206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7379 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p3), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=7 dest: 4}]], initial=0, aps=[p0:(LT s1720 1), p1:(GEQ s1828 1), p2:(AND (GEQ s301 1) (GEQ s404 1)), p3:(AND (GEQ s516 1) (GEQ s539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 988 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 7807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1194 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-09 15:56:57] [INFO ] Computed 42 place invariants in 188 ms
[2023-03-09 15:56:58] [INFO ] Implicit Places using invariants in 1381 ms returned []
[2023-03-09 15:56:58] [INFO ] Invariant cache hit.
[2023-03-09 15:56:59] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-09 15:57:02] [INFO ] Implicit Places using invariants and state equation in 3794 ms returned []
Implicit Place search using SMT with State Equation took 5191 ms to find 0 implicit places.
[2023-03-09 15:57:03] [INFO ] Redundant transitions in 807 ms returned []
[2023-03-09 15:57:03] [INFO ] Invariant cache hit.
[2023-03-09 15:57:05] [INFO ] Dead Transitions using invariants and state equation in 2637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9852 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s114 1) (GEQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-07 finished in 9911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 210 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:57:06] [INFO ] Computed 42 place invariants in 423 ms
[2023-03-09 15:57:07] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2023-03-09 15:57:07] [INFO ] Invariant cache hit.
[2023-03-09 15:57:09] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 3010 ms to find 0 implicit places.
[2023-03-09 15:57:09] [INFO ] Invariant cache hit.
[2023-03-09 15:57:13] [INFO ] Dead Transitions using invariants and state equation in 4530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7764 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s2774 1), p0:(GEQ s605 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 7867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1 U (G(p1)||(p1&&G(!p2)))))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 229 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-09 15:57:14] [INFO ] Invariant cache hit.
[2023-03-09 15:57:15] [INFO ] Implicit Places using invariants in 1776 ms returned []
[2023-03-09 15:57:15] [INFO ] Invariant cache hit.
[2023-03-09 15:57:18] [INFO ] Implicit Places using invariants and state equation in 3166 ms returned []
Implicit Place search using SMT with State Equation took 4945 ms to find 0 implicit places.
[2023-03-09 15:57:19] [INFO ] Invariant cache hit.
[2023-03-09 15:57:23] [INFO ] Dead Transitions using invariants and state equation in 4275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9469 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(LT s3244 1), p2:(AND (GEQ s469 1) (GEQ s2889 1)), p0:(LT s3659 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3288 ms.
Product exploration explored 100000 steps with 50000 reset in 3179 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 10 factoid took 258 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-11 finished in 16448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1067 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-09 15:57:31] [INFO ] Computed 42 place invariants in 193 ms
[2023-03-09 15:57:32] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-09 15:57:32] [INFO ] Invariant cache hit.
[2023-03-09 15:57:33] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-09 15:57:36] [INFO ] Implicit Places using invariants and state equation in 3977 ms returned []
Implicit Place search using SMT with State Equation took 5579 ms to find 0 implicit places.
[2023-03-09 15:57:37] [INFO ] Redundant transitions in 600 ms returned []
[2023-03-09 15:57:37] [INFO ] Invariant cache hit.
[2023-03-09 15:57:40] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9993 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 492 reset in 1154 ms.
Stack based approach found an accepted trace after 47891 steps with 234 reset with depth 210 and stack size 206 in 568 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 11804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1005 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-09 15:57:43] [INFO ] Computed 42 place invariants in 205 ms
[2023-03-09 15:57:44] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2023-03-09 15:57:44] [INFO ] Invariant cache hit.
[2023-03-09 15:57:45] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-09 15:57:48] [INFO ] Implicit Places using invariants and state equation in 3536 ms returned []
Implicit Place search using SMT with State Equation took 4959 ms to find 0 implicit places.
[2023-03-09 15:57:48] [INFO ] Redundant transitions in 607 ms returned []
[2023-03-09 15:57:48] [INFO ] Invariant cache hit.
[2023-03-09 15:57:51] [INFO ] Dead Transitions using invariants and state equation in 2884 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9466 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13 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 s156 1) (LT s174 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 512 reset in 902 ms.
Product exploration explored 100000 steps with 513 reset in 936 ms.
Computed a total of 121 stabilizing places and 200 stable transitions
Computed a total of 121 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 418 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=38 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 246 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-09 15:57:54] [INFO ] Invariant cache hit.
[2023-03-09 15:57:55] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2023-03-09 15:57:55] [INFO ] Invariant cache hit.
[2023-03-09 15:57:56] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-09 15:57:59] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 5314 ms to find 0 implicit places.
[2023-03-09 15:58:00] [INFO ] Redundant transitions in 553 ms returned []
[2023-03-09 15:58:00] [INFO ] Invariant cache hit.
[2023-03-09 15:58:03] [INFO ] Dead Transitions using invariants and state equation in 2892 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9034 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 121 stabilizing places and 200 stable transitions
Computed a total of 121 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3916 steps, including 18 resets, run visited all 1 properties in 39 ms. (steps per millisecond=100 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 514 reset in 1260 ms.
Product exploration explored 100000 steps with 514 reset in 1104 ms.
Built C files in :
/tmp/ltsmin2540735335047558283
[2023-03-09 15:58:06] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:58:06] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2540735335047558283
Running compilation step : cd /tmp/ltsmin2540735335047558283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2540735335047558283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2540735335047558283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 265 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-09 15:58:09] [INFO ] Invariant cache hit.
[2023-03-09 15:58:10] [INFO ] Implicit Places using invariants in 996 ms returned []
[2023-03-09 15:58:10] [INFO ] Invariant cache hit.
[2023-03-09 15:58:12] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2617 ms to find 0 implicit places.
[2023-03-09 15:58:12] [INFO ] Redundant transitions in 427 ms returned []
[2023-03-09 15:58:12] [INFO ] Invariant cache hit.
[2023-03-09 15:58:15] [INFO ] Dead Transitions using invariants and state equation in 2642 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5960 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Built C files in :
/tmp/ltsmin13653315448984146022
[2023-03-09 15:58:15] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:58:15] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13653315448984146022
Running compilation step : cd /tmp/ltsmin13653315448984146022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13653315448984146022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13653315448984146022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:58:18] [INFO ] Flatten gal took : 126 ms
[2023-03-09 15:58:18] [INFO ] Flatten gal took : 125 ms
[2023-03-09 15:58:18] [INFO ] Time to serialize gal into /tmp/LTL15977864284555983883.gal : 26 ms
[2023-03-09 15:58:18] [INFO ] Time to serialize properties into /tmp/LTL15467620275041762021.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15977864284555983883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut855708892858563281.hoa' '-atoms' '/tmp/LTL15467620275041762021.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15467620275041762021.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut855708892858563281.hoa
Detected timeout of ITS tools.
[2023-03-09 15:58:34] [INFO ] Flatten gal took : 150 ms
[2023-03-09 15:58:34] [INFO ] Flatten gal took : 107 ms
[2023-03-09 15:58:34] [INFO ] Time to serialize gal into /tmp/LTL17274606425660146019.gal : 19 ms
[2023-03-09 15:58:34] [INFO ] Time to serialize properties into /tmp/LTL4643945287867324467.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17274606425660146019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4643945287867324467.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node25Request<1)||(Node28IsInserted<1))"))))
Formula 0 simplified : FG!"((Node25Request<1)||(Node28IsInserted<1))"
Detected timeout of ITS tools.
[2023-03-09 15:58:49] [INFO ] Flatten gal took : 136 ms
[2023-03-09 15:58:49] [INFO ] Applying decomposition
[2023-03-09 15:58:49] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1262091748283412916.txt' '-o' '/tmp/graph1262091748283412916.bin' '-w' '/tmp/graph1262091748283412916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1262091748283412916.bin' '-l' '-1' '-v' '-w' '/tmp/graph1262091748283412916.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:58:50] [INFO ] Decomposing Gal with order
[2023-03-09 15:58:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:58:50] [INFO ] Removed a total of 4796 redundant transitions.
[2023-03-09 15:58:50] [INFO ] Flatten gal took : 383 ms
[2023-03-09 15:58:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3200 labels/synchronizations in 281 ms.
[2023-03-09 15:58:50] [INFO ] Time to serialize gal into /tmp/LTL17196667812601043994.gal : 23 ms
[2023-03-09 15:58:50] [INFO ] Time to serialize properties into /tmp/LTL257934943342133883.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17196667812601043994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL257934943342133883.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i26.u27.Node25Request<1)||(u30.Node28IsInserted<1))"))))
Formula 0 simplified : FG!"((i26.u27.Node25Request<1)||(u30.Node28IsInserted<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8183590398305743278
[2023-03-09 15:59:05] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8183590398305743278
Running compilation step : cd /tmp/ltsmin8183590398305743278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8183590398305743278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8183590398305743278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 86957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 287 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-09 15:59:09] [INFO ] Computed 42 place invariants in 525 ms
[2023-03-09 15:59:10] [INFO ] Implicit Places using invariants in 1378 ms returned []
[2023-03-09 15:59:10] [INFO ] Invariant cache hit.
[2023-03-09 15:59:13] [INFO ] Implicit Places using invariants and state equation in 3048 ms returned []
Implicit Place search using SMT with State Equation took 4429 ms to find 0 implicit places.
[2023-03-09 15:59:13] [INFO ] Invariant cache hit.
[2023-03-09 15:59:18] [INFO ] Dead Transitions using invariants and state equation in 4741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9461 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s2684 1), p1:(GEQ s3383 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-14 finished in 9710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-09 15:59:19] [INFO ] Flatten gal took : 219 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin186356908915872204
[2023-03-09 15:59:19] [INFO ] Too many transitions (9840) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:59:19] [INFO ] Applying decomposition
[2023-03-09 15:59:19] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin186356908915872204
Running compilation step : cd /tmp/ltsmin186356908915872204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 15:59:19] [INFO ] Flatten gal took : 198 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14434210281273194432.txt' '-o' '/tmp/graph14434210281273194432.bin' '-w' '/tmp/graph14434210281273194432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14434210281273194432.bin' '-l' '-1' '-v' '-w' '/tmp/graph14434210281273194432.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:59:20] [INFO ] Decomposing Gal with order
[2023-03-09 15:59:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:59:20] [INFO ] Removed a total of 4813 redundant transitions.
[2023-03-09 15:59:20] [INFO ] Flatten gal took : 431 ms
[2023-03-09 15:59:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4684 labels/synchronizations in 509 ms.
[2023-03-09 15:59:21] [INFO ] Time to serialize gal into /tmp/LTLFireability6656826775558297423.gal : 62 ms
[2023-03-09 15:59:21] [INFO ] Time to serialize properties into /tmp/LTLFireability12879115932551961514.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6656826775558297423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12879115932551961514.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G(F("((i9.u19.Node37GiveAnswer4>=1)||(i15.u35.Node3GiveAnswer8<1))")))U((X(("(i9.u19.Node37GiveAnswer4>=1)")U("(i28.u67.Node34Give...203
Formula 0 simplified : FG!"((i9.u19.Node37GiveAnswer4>=1)||(i15.u35.Node3GiveAnswer8<1))" R (X(!"(i9.u19.Node37GiveAnswer4>=1)" R !"(i28.u67.Node34GiveAnsw...193
Compilation finished in 48968 ms.
Running link step : cd /tmp/ltsmin186356908915872204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 124 ms.
Running LTSmin : cd /tmp/ltsmin186356908915872204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (X(((LTLAPp1==true) U (LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 16:22:11] [INFO ] Flatten gal took : 583 ms
[2023-03-09 16:22:11] [INFO ] Time to serialize gal into /tmp/LTLFireability18100266439782897324.gal : 88 ms
[2023-03-09 16:22:11] [INFO ] Time to serialize properties into /tmp/LTLFireability12475680182625593911.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18100266439782897324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12475680182625593911.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !(((G(F("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin186356908915872204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (X(((LTLAPp1==true) U (LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin186356908915872204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 16:45:00] [INFO ] Flatten gal took : 549 ms
[2023-03-09 16:45:01] [INFO ] Input system was already deterministic with 9840 transitions.
[2023-03-09 16:45:01] [INFO ] Transformed 3683 places.
[2023-03-09 16:45:01] [INFO ] Transformed 9840 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 16:45:12] [INFO ] Time to serialize gal into /tmp/LTLFireability14553913141921743388.gal : 70 ms
[2023-03-09 16:45:12] [INFO ] Time to serialize properties into /tmp/LTLFireability11381414347861195969.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14553913141921743388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11381414347861195969.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12549232 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16023672 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-040"
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-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-040, 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 r037-tajo-167813690800732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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