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.r039-tajo-167813692900716.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 lolaxred
Input is CANInsertWithFailure-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 2.6M 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-020-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678505819315

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:37:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:37:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:37:02] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-11 03:37:02] [INFO ] Transformed 1044 places.
[2023-03-11 03:37:02] [INFO ] Transformed 2520 transitions.
[2023-03-11 03:37:02] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 130 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:37:02] [INFO ] Computed 22 place invariants in 133 ms
[2023-03-11 03:37:03] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-11 03:37:03] [INFO ] Invariant cache hit.
[2023-03-11 03:37:04] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:06] [INFO ] Implicit Places using invariants and state equation in 3487 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
[2023-03-11 03:37:06] [INFO ] Invariant cache hit.
[2023-03-11 03:37:08] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5908 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 37 out of 1043 places after structural reductions.
[2023-03-11 03:37:08] [INFO ] Flatten gal took : 187 ms
[2023-03-11 03:37:08] [INFO ] Flatten gal took : 87 ms
[2023-03-11 03:37:08] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 34 out of 1043 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) 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 4) seen :1
Running SMT prover for 3 properties.
[2023-03-11 03:37:09] [INFO ] Invariant cache hit.
[2023-03-11 03:37:09] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-11 03:37:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 03:37:10] [INFO ] After 788ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:37:10] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:10] [INFO ] After 264ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:37:10] [INFO ] After 1384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:37:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 71 ms returned sat
[2023-03-11 03:37:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:37:12] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:13] [INFO ] After 1124ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:14] [INFO ] After 1808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 398 ms.
[2023-03-11 03:37:14] [INFO ] After 3491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 21 ms.
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1043 transition count 2401
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 924 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 923 transition count 2400
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 2 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 3 with 754 rules applied. Total rules applied 994 place count 546 transition count 2023
Drop transitions removed 339 transitions
Redundant transition composition rules discarded 339 transitions
Iterating global reduction 3 with 339 rules applied. Total rules applied 1333 place count 546 transition count 1684
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1353 place count 546 transition count 1664
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1373 place count 526 transition count 1664
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 4 with 421 rules applied. Total rules applied 1794 place count 526 transition count 1664
Applied a total of 1794 rules in 472 ms. Remains 526 /1043 variables (removed 517) and now considering 1664/2520 (removed 856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 526/1043 places, 1664/2520 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :1
Finished Best-First random walk after 2941 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=490 )
FORMULA CANInsertWithFailure-PT-020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 82 stabilizing places and 140 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(F(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 36 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:37:15] [INFO ] Invariant cache hit.
[2023-03-11 03:37:16] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-11 03:37:16] [INFO ] Invariant cache hit.
[2023-03-11 03:37:16] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:19] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3539 ms to find 0 implicit places.
[2023-03-11 03:37:19] [INFO ] Invariant cache hit.
[2023-03-11 03:37:20] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4613 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s454 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 398 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-01 finished in 5032 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)&&X(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:37:20] [INFO ] Invariant cache hit.
[2023-03-11 03:37:20] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-11 03:37:20] [INFO ] Invariant cache hit.
[2023-03-11 03:37:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:24] [INFO ] Implicit Places using invariants and state equation in 4038 ms returned []
Implicit Place search using SMT with State Equation took 4384 ms to find 0 implicit places.
[2023-03-11 03:37:24] [INFO ] Invariant cache hit.
[2023-03-11 03:37:26] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5641 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s594 1), p1:(OR (LT s203 1) (LT s309 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1218 ms.
Product exploration explored 100000 steps with 50000 reset in 1083 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-02 finished in 8395 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||X(p1)))&&X(F((p1||G(!p0))))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:37:28] [INFO ] Invariant cache hit.
[2023-03-11 03:37:29] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-11 03:37:29] [INFO ] Invariant cache hit.
[2023-03-11 03:37:30] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:32] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2023-03-11 03:37:32] [INFO ] Invariant cache hit.
[2023-03-11 03:37:34] [INFO ] Dead Transitions using invariants and state equation in 1590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5132 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s589 1)), p1:(GEQ s863 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 548 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-03 finished in 5342 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(X(X((F(G(p0)) U p1)))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 34 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:37:34] [INFO ] Invariant cache hit.
[2023-03-11 03:37:34] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-11 03:37:34] [INFO ] Invariant cache hit.
[2023-03-11 03:37:35] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:39] [INFO ] Implicit Places using invariants and state equation in 4099 ms returned []
Implicit Place search using SMT with State Equation took 4763 ms to find 0 implicit places.
[2023-03-11 03:37:39] [INFO ] Invariant cache hit.
[2023-03-11 03:37:40] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5777 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s942 1) (OR (GEQ s780 1) (AND (GEQ s0 1) (GEQ s199 1)))), p0:(LT s882 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 212 reset in 445 ms.
Product exploration explored 100000 steps with 209 reset in 512 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 137346 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137346 steps, saw 39165 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:37:44] [INFO ] Invariant cache hit.
[2023-03-11 03:37:45] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-11 03:37:45] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-11 03:37:45] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:37:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-11 03:37:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:37:46] [INFO ] After 724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:37:46] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:46] [INFO ] After 487ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:37:47] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-11 03:37:47] [INFO ] After 2331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 360 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-11 03:37:48] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-04 finished in 15513 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 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 380 Post agglomeration using F-continuation condition.Transition count delta: 380
Deduced a syphon composed of 380 places in 0 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 1040 place count 523 transition count 2000
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1382 place count 523 transition count 1658
Applied a total of 1382 rules in 192 ms. Remains 523 /1043 variables (removed 520) and now considering 1658/2520 (removed 862) transitions.
// Phase 1: matrix 1658 rows 523 cols
[2023-03-11 03:37:49] [INFO ] Computed 22 place invariants in 43 ms
[2023-03-11 03:37:50] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-11 03:37:50] [INFO ] Invariant cache hit.
[2023-03-11 03:37:50] [INFO ] State equation strengthened by 1178 read => feed constraints.
[2023-03-11 03:37:52] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2023-03-11 03:37:52] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-11 03:37:52] [INFO ] Invariant cache hit.
[2023-03-11 03:37:53] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 523/1043 places, 1658/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3336 ms. Remains : 523/1043 places, 1658/2520 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s482 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-05 finished in 3468 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&&G(F(p1)))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 37 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:37:53] [INFO ] Computed 22 place invariants in 58 ms
[2023-03-11 03:37:53] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-11 03:37:53] [INFO ] Invariant cache hit.
[2023-03-11 03:37:54] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:57] [INFO ] Implicit Places using invariants and state equation in 3417 ms returned []
Implicit Place search using SMT with State Equation took 3871 ms to find 0 implicit places.
[2023-03-11 03:37:57] [INFO ] Invariant cache hit.
[2023-03-11 03:37:58] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4856 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s506 1), p1:(GEQ s702 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-06 finished in 5126 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 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 1043 transition count 2381
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 151 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:37:58] [INFO ] Computed 22 place invariants in 35 ms
[2023-03-11 03:37:58] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-11 03:37:58] [INFO ] Invariant cache hit.
[2023-03-11 03:37:59] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:38:00] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
[2023-03-11 03:38:00] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-11 03:38:00] [INFO ] Invariant cache hit.
[2023-03-11 03:38:01] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3048 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-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:(OR (GEQ s375 1) (LT s29 1) (LT s268 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 967 reset in 510 ms.
Stack based approach found an accepted trace after 51166 steps with 501 reset with depth 68 and stack size 68 in 208 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-07 finished in 3836 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((G(!p0) U X(X(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 26 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:38:02] [INFO ] Computed 22 place invariants in 63 ms
[2023-03-11 03:38:02] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-11 03:38:02] [INFO ] Invariant cache hit.
[2023-03-11 03:38:03] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:05] [INFO ] Implicit Places using invariants and state equation in 2913 ms returned []
Implicit Place search using SMT with State Equation took 3371 ms to find 0 implicit places.
[2023-03-11 03:38:05] [INFO ] Invariant cache hit.
[2023-03-11 03:38:06] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4532 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s77 1) (GEQ s443 1)), p1:(GEQ s192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5767 steps with 12 reset in 43 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-08 finished in 4951 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(G(p0)))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 30 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:38:07] [INFO ] Invariant cache hit.
[2023-03-11 03:38:07] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-11 03:38:07] [INFO ] Invariant cache hit.
[2023-03-11 03:38:08] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:10] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
[2023-03-11 03:38:10] [INFO ] Invariant cache hit.
[2023-03-11 03:38:11] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4750 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 478 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s840 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1099 steps with 1 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-10 finished in 5272 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((G(p1)||p0))||F(p2)))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 42 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:38:12] [INFO ] Invariant cache hit.
[2023-03-11 03:38:12] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-11 03:38:12] [INFO ] Invariant cache hit.
[2023-03-11 03:38:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:15] [INFO ] Implicit Places using invariants and state equation in 2875 ms returned []
Implicit Place search using SMT with State Equation took 3322 ms to find 0 implicit places.
[2023-03-11 03:38:15] [INFO ] Invariant cache hit.
[2023-03-11 03:38:16] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4357 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s35 1) (GEQ s401 1)), p0:(OR (AND (GEQ s548 1) (GEQ s311 1)) (LT s924 1)), p1:(GEQ s924 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 788 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-11 finished in 6342 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||G(p1)||(p2&&G(!p1)))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 276 place count 905 transition count 2381
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Applied a total of 1378 rules in 166 ms. Remains 525 /1043 variables (removed 518) and now considering 1660/2520 (removed 860) transitions.
// Phase 1: matrix 1660 rows 525 cols
[2023-03-11 03:38:18] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-11 03:38:19] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-11 03:38:19] [INFO ] Invariant cache hit.
[2023-03-11 03:38:19] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:38:21] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2023-03-11 03:38:21] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 03:38:21] [INFO ] Invariant cache hit.
[2023-03-11 03:38:22] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3278 ms. Remains : 525/1043 places, 1660/2520 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (OR p1 (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) p1), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s19 1)), p1:(GEQ s255 1), p2:(LT s521 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 174 steps with 1 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-12 finished in 3539 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(X(F(p0))))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 25 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:38:22] [INFO ] Computed 22 place invariants in 44 ms
[2023-03-11 03:38:22] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-11 03:38:22] [INFO ] Invariant cache hit.
[2023-03-11 03:38:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:25] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 3265 ms to find 0 implicit places.
[2023-03-11 03:38:25] [INFO ] Invariant cache hit.
[2023-03-11 03:38:26] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4457 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-13 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 s495 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 545 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-13 finished in 4628 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((G(F(p0)) U G(p1))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:38:26] [INFO ] Invariant cache hit.
[2023-03-11 03:38:27] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-11 03:38:27] [INFO ] Invariant cache hit.
[2023-03-11 03:38:28] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:30] [INFO ] Implicit Places using invariants and state equation in 3701 ms returned []
Implicit Place search using SMT with State Equation took 4010 ms to find 0 implicit places.
[2023-03-11 03:38:30] [INFO ] Invariant cache hit.
[2023-03-11 03:38:32] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5083 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s782 1), p0:(GEQ s792 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 719 steps with 3 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLFireability-14 finished in 5329 ms.
All properties solved by simple procedures.
Total runtime 90579 ms.
ITS solved all properties within timeout

BK_STOP 1678505912522

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANInsertWithFailure-PT-020, 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 r039-tajo-167813692900716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 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 ;