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-167813692900732.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-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900732
=====================================================================

--------------------
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 1678506657866

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-040
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:50:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:51:00] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2023-03-11 03:51:00] [INFO ] Transformed 3684 places.
[2023-03-11 03:51:00] [INFO ] Transformed 9840 transitions.
[2023-03-11 03:51:00] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 539 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 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 456 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:51:01] [INFO ] Computed 42 place invariants in 490 ms
[2023-03-11 03:51:02] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2023-03-11 03:51:02] [INFO ] Invariant cache hit.
[2023-03-11 03:51:07] [INFO ] Implicit Places using invariants and state equation in 4551 ms returned []
Implicit Place search using SMT with State Equation took 6099 ms to find 0 implicit places.
[2023-03-11 03:51:07] [INFO ] Invariant cache hit.
[2023-03-11 03:51:13] [INFO ] Dead Transitions using invariants and state equation in 6146 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 12706 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 38 out of 3683 places after structural reductions.
[2023-03-11 03:51:13] [INFO ] Flatten gal took : 321 ms
[2023-03-11 03:51:14] [INFO ] Flatten gal took : 233 ms
[2023-03-11 03:51:14] [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 10 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 29) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 03:51:15] [INFO ] Invariant cache hit.
[2023-03-11 03:51:16] [INFO ] [Real]Absence check using 40 positive place invariants in 62 ms returned sat
[2023-03-11 03:51:16] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 81 ms returned sat
[2023-03-11 03:51:24] [INFO ] After 6802ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12 real:1
[2023-03-11 03:51:24] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:51:30] [INFO ] After 5716ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 03:51:30] [INFO ] After 14578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 03:51:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-11 03:51:31] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 47 ms returned sat
[2023-03-11 03:51:39] [INFO ] After 7218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 03:51:52] [INFO ] After 13534ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-11 03:51:55] [INFO ] After 15863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:51:55] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 9 properties in 393 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 5 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5151 place count 1847 transition count 6525
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5153 place count 1847 transition count 6523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6795 place count 1845 transition count 6523
Applied a total of 6795 rules in 2674 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2689 ms. Remains : 1845/3683 places, 6523/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6523 rows 1845 cols
[2023-03-11 03:51:58] [INFO ] Computed 42 place invariants in 172 ms
[2023-03-11 03:51:59] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-11 03:51:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:52:01] [INFO ] After 2132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:52:01] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2023-03-11 03:52:02] [INFO ] After 687ms SMT Verify possible using 6394 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:52:02] [INFO ] After 3337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:52:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 44 ms returned sat
[2023-03-11 03:52:02] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-11 03:52:04] [INFO ] After 1518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:04] [INFO ] After 525ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:52:04] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-11 03:52:05] [INFO ] After 2973ms 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 339 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:52:06] [INFO ] Computed 42 place invariants in 458 ms
[2023-03-11 03:52:07] [INFO ] Implicit Places using invariants in 1699 ms returned []
[2023-03-11 03:52:07] [INFO ] Invariant cache hit.
[2023-03-11 03:52:11] [INFO ] Implicit Places using invariants and state equation in 3265 ms returned []
Implicit Place search using SMT with State Equation took 4979 ms to find 0 implicit places.
[2023-03-11 03:52:11] [INFO ] Invariant cache hit.
[2023-03-11 03:52:18] [INFO ] Dead Transitions using invariants and state equation in 6926 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12251 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 290 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 1148 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 12681 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 206 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:52:18] [INFO ] Invariant cache hit.
[2023-03-11 03:52:19] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-11 03:52:19] [INFO ] Invariant cache hit.
[2023-03-11 03:52:20] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2023-03-11 03:52:20] [INFO ] Invariant cache hit.
[2023-03-11 03:52:31] [INFO ] Dead Transitions using invariants and state equation in 11067 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13083 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 511 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 105 reset in 1021 ms.
Product exploration explored 100000 steps with 101 reset in 1178 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 1816 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 407 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 9 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 03:52:37] [INFO ] Invariant cache hit.
[2023-03-11 03:52:38] [INFO ] [Real]Absence check using 40 positive place invariants in 33 ms returned sat
[2023-03-11 03:52:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 82 ms returned sat
[2023-03-11 03:52:45] [INFO ] After 6440ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:6
[2023-03-11 03:52:45] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:52:45] [INFO ] After 794ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :3 sat :0 real:7
[2023-03-11 03:52:45] [INFO ] After 8339ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:7
[2023-03-11 03:52:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 33 ms returned sat
[2023-03-11 03:52:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-11 03:52:52] [INFO ] After 5645ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-11 03:53:05] [INFO ] After 13305ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :3 sat :7
[2023-03-11 03:53:10] [INFO ] After 18065ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-11 03:53:10] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 61 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 3 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 1607 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 1607 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107087 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107087 steps, saw 27105 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-11 03:53:16] [INFO ] Computed 42 place invariants in 117 ms
[2023-03-11 03:53:16] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-11 03:53:16] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:53:18] [INFO ] After 1570ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 03:53:18] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:53:19] [INFO ] After 940ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:53:19] [INFO ] After 3065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:53:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-11 03:53:19] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-11 03:53:22] [INFO ] After 2349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:53:24] [INFO ] After 2440ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:53:25] [INFO ] After 3811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 920 ms.
[2023-03-11 03:53:26] [INFO ] After 7564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 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 154 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 156 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 177 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-11 03:53:27] [INFO ] Invariant cache hit.
[2023-03-11 03:53:32] [INFO ] Implicit Places using invariants in 4907 ms returned []
[2023-03-11 03:53:32] [INFO ] Invariant cache hit.
[2023-03-11 03:53:33] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:53:42] [INFO ] Implicit Places using invariants and state equation in 10650 ms returned []
Implicit Place search using SMT with State Equation took 15564 ms to find 0 implicit places.
[2023-03-11 03:53:43] [INFO ] Redundant transitions in 766 ms returned []
[2023-03-11 03:53:43] [INFO ] Invariant cache hit.
[2023-03-11 03:53:48] [INFO ] Dead Transitions using invariants and state equation in 4556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21089 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 8 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.1 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 48 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-11 03:53:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:53:48] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 03:53:48] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:53:48] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-11 03:53:48] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:53:48] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:53:48] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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 (AND (NOT p0) p3 (NOT p1) (NOT p2))), (F (NOT p3)), (F (NOT p0)), (F (NOT (AND p3 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 26 factoid took 1779 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 218 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 255 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 266 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:53:51] [INFO ] Computed 42 place invariants in 581 ms
[2023-03-11 03:53:52] [INFO ] Implicit Places using invariants in 1537 ms returned []
[2023-03-11 03:53:52] [INFO ] Invariant cache hit.
[2023-03-11 03:53:54] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 3178 ms to find 0 implicit places.
[2023-03-11 03:53:54] [INFO ] Invariant cache hit.
[2023-03-11 03:53:57] [INFO ] Dead Transitions using invariants and state equation in 3857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7306 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 1436 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 403 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 335 ms. (steps per millisecond=29 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 03:54:00] [INFO ] Invariant cache hit.
[2023-03-11 03:54:00] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2023-03-11 03:54:01] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-11 03:54:07] [INFO ] After 6108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 03:54:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-11 03:54:08] [INFO ] After 719ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:54:08] [INFO ] After 7746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:54:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2023-03-11 03:54:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 46 ms returned sat
[2023-03-11 03:54:13] [INFO ] After 4817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:54:26] [INFO ] After 12241ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 03:54:30] [INFO ] After 16424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2689 ms.
[2023-03-11 03:54:32] [INFO ] After 24962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 60 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 3 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 1524 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 1527 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 6) seen :1
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-11 03:54:35] [INFO ] Computed 42 place invariants in 116 ms
[2023-03-11 03:54:35] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 03:54:35] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-11 03:54:37] [INFO ] After 1427ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 03:54:37] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:54:37] [INFO ] After 813ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:54:37] [INFO ] After 2717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:54:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2023-03-11 03:54:38] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 03:54:41] [INFO ] After 2603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:54:44] [INFO ] After 3157ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 03:54:46] [INFO ] After 5163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1347 ms.
[2023-03-11 03:54:47] [INFO ] After 9590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 26 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 256 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 257 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 5) seen :2
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 23 ms. (steps per millisecond=434 ) 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
Running SMT prover for 3 properties.
[2023-03-11 03:54:48] [INFO ] Invariant cache hit.
[2023-03-11 03:54:48] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 03:54:48] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 03:54:50] [INFO ] After 2128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:54:50] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:54:51] [INFO ] After 1158ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:51] [INFO ] After 3750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:54:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 03:54:52] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 03:54:54] [INFO ] After 2405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:54:56] [INFO ] After 1910ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:54:57] [INFO ] After 3104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 723 ms.
[2023-03-11 03:54:58] [INFO ] After 6640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 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 223 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 226 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 89561 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89561 steps, saw 24992 distinct states, run finished after 3014 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:55:02] [INFO ] Invariant cache hit.
[2023-03-11 03:55:02] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-11 03:55:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-11 03:55:04] [INFO ] After 1866ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:55:04] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:55:05] [INFO ] After 1038ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:55:05] [INFO ] After 3311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:55:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-11 03:55:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:55:08] [INFO ] After 2422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:10] [INFO ] After 1756ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:11] [INFO ] After 2804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 687 ms.
[2023-03-11 03:55:11] [INFO ] After 6282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 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 219 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 219 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 214 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-11 03:55:12] [INFO ] Invariant cache hit.
[2023-03-11 03:55:14] [INFO ] Implicit Places using invariants in 1956 ms returned []
[2023-03-11 03:55:14] [INFO ] Invariant cache hit.
[2023-03-11 03:55:15] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-11 03:55:15] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
[2023-03-11 03:55:16] [INFO ] Redundant transitions in 684 ms returned []
[2023-03-11 03:55:16] [INFO ] Invariant cache hit.
[2023-03-11 03:55:19] [INFO ] Dead Transitions using invariants and state equation in 2772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6973 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 3 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.1 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 25 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-11 03:55:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:55:19] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:55:19] [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 2 ms.
[2023-03-11 03:55:19] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:55:19] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:55:19] [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-11 03:55:19] [INFO ] After 34ms 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 1350 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 464 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 414 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 465 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 104 reset in 971 ms.
Product exploration explored 100000 steps with 102 reset in 780 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 258 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 6 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 5 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 3 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 3604 ms. Remains 3445 /3683 variables (removed 238) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3445 cols
[2023-03-11 03:55:28] [INFO ] Computed 42 place invariants in 459 ms
[2023-03-11 03:55:34] [INFO ] Dead Transitions using invariants and state equation in 6248 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 9858 ms. Remains : 3445/3683 places, 11157/9840 transitions.
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 220 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:55:34] [INFO ] Computed 42 place invariants in 506 ms
[2023-03-11 03:55:35] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2023-03-11 03:55:35] [INFO ] Invariant cache hit.
[2023-03-11 03:55:39] [INFO ] Implicit Places using invariants and state equation in 4172 ms returned []
Implicit Place search using SMT with State Equation took 5610 ms to find 0 implicit places.
[2023-03-11 03:55:39] [INFO ] Invariant cache hit.
[2023-03-11 03:55:44] [INFO ] Dead Transitions using invariants and state equation in 4880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10713 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 206801 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 284 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:55:45] [INFO ] Invariant cache hit.
[2023-03-11 03:55:46] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-11 03:55:46] [INFO ] Invariant cache hit.
[2023-03-11 03:55:47] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1744 ms to find 0 implicit places.
[2023-03-11 03:55:47] [INFO ] Invariant cache hit.
[2023-03-11 03:55:52] [INFO ] Dead Transitions using invariants and state equation in 4775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6804 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 551 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 976 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 7430 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 283 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:55:52] [INFO ] Invariant cache hit.
[2023-03-11 03:55:53] [INFO ] Implicit Places using invariants in 953 ms returned []
[2023-03-11 03:55:53] [INFO ] Invariant cache hit.
[2023-03-11 03:55:56] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 3969 ms to find 0 implicit places.
[2023-03-11 03:55:56] [INFO ] Invariant cache hit.
[2023-03-11 03:56:01] [INFO ] Dead Transitions using invariants and state equation in 4899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9152 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 164 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]]
Stuttering criterion allowed to conclude after 1115 steps with 0 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 9387 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 268 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:56:02] [INFO ] Invariant cache hit.
[2023-03-11 03:56:03] [INFO ] Implicit Places using invariants in 803 ms returned []
[2023-03-11 03:56:03] [INFO ] Invariant cache hit.
[2023-03-11 03:56:05] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3638 ms to find 0 implicit places.
[2023-03-11 03:56:05] [INFO ] Invariant cache hit.
[2023-03-11 03:56:10] [INFO ] Dead Transitions using invariants and state equation in 4693 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8603 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 500 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 899 steps with 0 reset in 13 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 9173 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 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 1112 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-11 03:56:12] [INFO ] Computed 42 place invariants in 192 ms
[2023-03-11 03:56:13] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2023-03-11 03:56:13] [INFO ] Invariant cache hit.
[2023-03-11 03:56:14] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:56:17] [INFO ] Implicit Places using invariants and state equation in 3804 ms returned []
Implicit Place search using SMT with State Equation took 5104 ms to find 0 implicit places.
[2023-03-11 03:56:18] [INFO ] Redundant transitions in 772 ms returned []
[2023-03-11 03:56:18] [INFO ] Invariant cache hit.
[2023-03-11 03:56:21] [INFO ] Dead Transitions using invariants and state equation in 2782 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 9786 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 35 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 248 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-07 finished in 9859 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 211 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-11 03:56:21] [INFO ] Computed 42 place invariants in 532 ms
[2023-03-11 03:56:23] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2023-03-11 03:56:23] [INFO ] Invariant cache hit.
[2023-03-11 03:56:26] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 5436 ms to find 0 implicit places.
[2023-03-11 03:56:26] [INFO ] Invariant cache hit.
[2023-03-11 03:56:32] [INFO ] Dead Transitions using invariants and state equation in 5557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11205 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 88 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 11325 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 256 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-11 03:56:32] [INFO ] Invariant cache hit.
[2023-03-11 03:56:34] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2023-03-11 03:56:34] [INFO ] Invariant cache hit.
[2023-03-11 03:56:35] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 2865 ms to find 0 implicit places.
[2023-03-11 03:56:35] [INFO ] Invariant cache hit.
[2023-03-11 03:56:40] [INFO ] Dead Transitions using invariants and state equation in 5383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8508 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 180 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 2719 ms.
Product exploration explored 100000 steps with 50000 reset in 2990 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 223 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 14693 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 4 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 1057 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-11 03:56:48] [INFO ] Computed 42 place invariants in 207 ms
[2023-03-11 03:56:49] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-11 03:56:49] [INFO ] Invariant cache hit.
[2023-03-11 03:56:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:56:53] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 5113 ms to find 0 implicit places.
[2023-03-11 03:56:53] [INFO ] Redundant transitions in 454 ms returned []
[2023-03-11 03:56:53] [INFO ] Invariant cache hit.
[2023-03-11 03:56:56] [INFO ] Dead Transitions using invariants and state equation in 2663 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 9296 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 33 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 1082 ms.
Product exploration explored 100000 steps with 492 reset in 1104 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1032 steps, including 4 resets, run visited all 1 properties in 15 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 182 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 03:56:59] [INFO ] Invariant cache hit.
[2023-03-11 03:57:00] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2023-03-11 03:57:00] [INFO ] Invariant cache hit.
[2023-03-11 03:57:01] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:57:04] [INFO ] Implicit Places using invariants and state equation in 3591 ms returned []
Implicit Place search using SMT with State Equation took 4723 ms to find 0 implicit places.
[2023-03-11 03:57:04] [INFO ] Redundant transitions in 465 ms returned []
[2023-03-11 03:57:04] [INFO ] Invariant cache hit.
[2023-03-11 03:57:07] [INFO ] Dead Transitions using invariants and state equation in 2751 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8130 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 1417 steps, including 7 resets, run visited all 1 properties in 19 ms. (steps per millisecond=74 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 491 reset in 1084 ms.
Product exploration explored 100000 steps with 490 reset in 1095 ms.
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 183 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 03:57:10] [INFO ] Invariant cache hit.
[2023-03-11 03:57:11] [INFO ] Implicit Places using invariants in 1074 ms returned []
[2023-03-11 03:57:11] [INFO ] Invariant cache hit.
[2023-03-11 03:57:12] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:57:14] [INFO ] Implicit Places using invariants and state equation in 3257 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
[2023-03-11 03:57:14] [INFO ] Redundant transitions in 475 ms returned []
[2023-03-11 03:57:14] [INFO ] Invariant cache hit.
[2023-03-11 03:57:17] [INFO ] Dead Transitions using invariants and state equation in 2645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7649 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 30604 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 1011 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-11 03:57:18] [INFO ] Computed 42 place invariants in 187 ms
[2023-03-11 03:57:19] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2023-03-11 03:57:19] [INFO ] Invariant cache hit.
[2023-03-11 03:57:20] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:57:22] [INFO ] Implicit Places using invariants and state equation in 3091 ms returned []
Implicit Place search using SMT with State Equation took 4248 ms to find 0 implicit places.
[2023-03-11 03:57:23] [INFO ] Redundant transitions in 638 ms returned []
[2023-03-11 03:57:23] [INFO ] Invariant cache hit.
[2023-03-11 03:57:26] [INFO ] Dead Transitions using invariants and state equation in 2642 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 8547 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 112 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 519 reset in 1080 ms.
Product exploration explored 100000 steps with 516 reset in 1086 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 123 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 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1145 steps, including 5 resets, run visited all 1 properties in 15 ms. (steps per millisecond=76 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 171 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 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 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 180 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-11 03:57:29] [INFO ] Invariant cache hit.
[2023-03-11 03:57:30] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2023-03-11 03:57:30] [INFO ] Invariant cache hit.
[2023-03-11 03:57:31] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-11 03:57:33] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 4328 ms to find 0 implicit places.
[2023-03-11 03:57:34] [INFO ] Redundant transitions in 488 ms returned []
[2023-03-11 03:57:34] [INFO ] Invariant cache hit.
[2023-03-11 03:57:37] [INFO ] Dead Transitions using invariants and state equation in 2778 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7795 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 96 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 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1101 steps, including 5 resets, run visited all 1 properties in 12 ms. (steps per millisecond=91 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 512 reset in 1205 ms.
Stack based approach found an accepted trace after 79929 steps with 408 reset with depth 102 and stack size 102 in 890 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 22041 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 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-11 03:57:40] [INFO ] Computed 42 place invariants in 459 ms
[2023-03-11 03:57:41] [INFO ] Implicit Places using invariants in 1343 ms returned []
[2023-03-11 03:57:41] [INFO ] Invariant cache hit.
[2023-03-11 03:57:44] [INFO ] Implicit Places using invariants and state equation in 3313 ms returned []
Implicit Place search using SMT with State Equation took 4658 ms to find 0 implicit places.
[2023-03-11 03:57:44] [INFO ] Invariant cache hit.
[2023-03-11 03:57:48] [INFO ] Dead Transitions using invariants and state equation in 4333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9202 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 221 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 9506 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' '!(F(G(p0)))'
[2023-03-11 03:57:49] [INFO ] Flatten gal took : 259 ms
[2023-03-11 03:57:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:57:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 40 ms.
Total runtime 410180 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-040
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

BK_STOP 1678507476661

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 CANInsertWithFailure-PT-040-LTLFireability-03
lola: time limit : 1798 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 2/1798 2/32 CANInsertWithFailure-PT-040-LTLFireability-03 27399 m, 5479 m/sec, 47842 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 7/1798 6/32 CANInsertWithFailure-PT-040-LTLFireability-03 157974 m, 26115 m/sec, 304889 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 12/1798 8/32 CANInsertWithFailure-PT-040-LTLFireability-03 216339 m, 11673 m/sec, 559827 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 17/1798 10/32 CANInsertWithFailure-PT-040-LTLFireability-03 268009 m, 10334 m/sec, 806439 t fired, .

Time elapsed: 21 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 22/1798 11/32 CANInsertWithFailure-PT-040-LTLFireability-03 320015 m, 10401 m/sec, 1052366 t fired, .

Time elapsed: 26 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 27/1798 13/32 CANInsertWithFailure-PT-040-LTLFireability-03 379601 m, 11917 m/sec, 1318293 t fired, .

Time elapsed: 31 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 32/1798 15/32 CANInsertWithFailure-PT-040-LTLFireability-03 435285 m, 11136 m/sec, 1585715 t fired, .

Time elapsed: 36 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 37/1798 17/32 CANInsertWithFailure-PT-040-LTLFireability-03 488247 m, 10592 m/sec, 1848495 t fired, .

Time elapsed: 41 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 42/1798 18/32 CANInsertWithFailure-PT-040-LTLFireability-03 542325 m, 10815 m/sec, 2112720 t fired, .

Time elapsed: 46 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 47/1798 20/32 CANInsertWithFailure-PT-040-LTLFireability-03 597324 m, 10999 m/sec, 2378624 t fired, .

Time elapsed: 51 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 52/1798 22/32 CANInsertWithFailure-PT-040-LTLFireability-03 649406 m, 10416 m/sec, 2642853 t fired, .

Time elapsed: 56 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 57/1798 23/32 CANInsertWithFailure-PT-040-LTLFireability-03 699343 m, 9987 m/sec, 2906101 t fired, .

Time elapsed: 61 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 62/1798 25/32 CANInsertWithFailure-PT-040-LTLFireability-03 749765 m, 10084 m/sec, 3169850 t fired, .

Time elapsed: 66 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 67/1798 27/32 CANInsertWithFailure-PT-040-LTLFireability-03 798030 m, 9653 m/sec, 3433047 t fired, .

Time elapsed: 71 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 72/1798 28/32 CANInsertWithFailure-PT-040-LTLFireability-03 849689 m, 10331 m/sec, 3704604 t fired, .

Time elapsed: 76 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 77/1798 30/32 CANInsertWithFailure-PT-040-LTLFireability-03 897067 m, 9475 m/sec, 3969270 t fired, .

Time elapsed: 81 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 82/1798 31/32 CANInsertWithFailure-PT-040-LTLFireability-03 944421 m, 9470 m/sec, 4229424 t fired, .

Time elapsed: 86 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for CANInsertWithFailure-PT-040-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CANInsertWithFailure-PT-040-LTLFireability-12
lola: time limit : 3509 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3509 1/32 CANInsertWithFailure-PT-040-LTLFireability-12 21883 m, 4376 m/sec, 57903 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3509 2/32 CANInsertWithFailure-PT-040-LTLFireability-12 42526 m, 4128 m/sec, 113628 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3509 2/32 CANInsertWithFailure-PT-040-LTLFireability-12 64231 m, 4341 m/sec, 174883 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3509 3/32 CANInsertWithFailure-PT-040-LTLFireability-12 87791 m, 4712 m/sec, 241085 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3509 4/32 CANInsertWithFailure-PT-040-LTLFireability-12 111641 m, 4770 m/sec, 308539 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3509 4/32 CANInsertWithFailure-PT-040-LTLFireability-12 137658 m, 5203 m/sec, 381524 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3509 5/32 CANInsertWithFailure-PT-040-LTLFireability-12 163802 m, 5228 m/sec, 455755 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3509 6/32 CANInsertWithFailure-PT-040-LTLFireability-12 192548 m, 5749 m/sec, 537594 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3509 6/32 CANInsertWithFailure-PT-040-LTLFireability-12 215609 m, 4612 m/sec, 600635 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3509 7/32 CANInsertWithFailure-PT-040-LTLFireability-12 238729 m, 4624 m/sec, 665667 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3509 7/32 CANInsertWithFailure-PT-040-LTLFireability-12 262872 m, 4828 m/sec, 734039 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3509 7/32 CANInsertWithFailure-PT-040-LTLFireability-12 284712 m, 4368 m/sec, 795009 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3509 8/32 CANInsertWithFailure-PT-040-LTLFireability-12 307565 m, 4570 m/sec, 859101 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3509 8/32 CANInsertWithFailure-PT-040-LTLFireability-12 327595 m, 4006 m/sec, 916913 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3509 9/32 CANInsertWithFailure-PT-040-LTLFireability-12 349660 m, 4413 m/sec, 981329 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3509 9/32 CANInsertWithFailure-PT-040-LTLFireability-12 371993 m, 4466 m/sec, 1045557 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3509 10/32 CANInsertWithFailure-PT-040-LTLFireability-12 394622 m, 4525 m/sec, 1110972 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/3509 10/32 CANInsertWithFailure-PT-040-LTLFireability-12 416822 m, 4440 m/sec, 1174962 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/3509 11/32 CANInsertWithFailure-PT-040-LTLFireability-12 439699 m, 4575 m/sec, 1241687 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/3509 11/32 CANInsertWithFailure-PT-040-LTLFireability-12 465312 m, 5122 m/sec, 1315935 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/3509 12/32 CANInsertWithFailure-PT-040-LTLFireability-12 491890 m, 5315 m/sec, 1392409 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/3509 12/32 CANInsertWithFailure-PT-040-LTLFireability-12 514485 m, 4519 m/sec, 1458010 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/3509 12/32 CANInsertWithFailure-PT-040-LTLFireability-12 537576 m, 4618 m/sec, 1524640 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/3509 13/32 CANInsertWithFailure-PT-040-LTLFireability-12 558990 m, 4282 m/sec, 1586227 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/3509 13/32 CANInsertWithFailure-PT-040-LTLFireability-12 582064 m, 4614 m/sec, 1652804 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/3509 14/32 CANInsertWithFailure-PT-040-LTLFireability-12 604824 m, 4552 m/sec, 1718934 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 135/3509 14/32 CANInsertWithFailure-PT-040-LTLFireability-12 628079 m, 4651 m/sec, 1786439 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 140/3509 15/32 CANInsertWithFailure-PT-040-LTLFireability-12 651949 m, 4774 m/sec, 1855359 t fired, .

Time elapsed: 231 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 145/3509 15/32 CANInsertWithFailure-PT-040-LTLFireability-12 674818 m, 4573 m/sec, 1922481 t fired, .

Time elapsed: 236 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 150/3509 16/32 CANInsertWithFailure-PT-040-LTLFireability-12 697138 m, 4464 m/sec, 1986932 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 155/3509 16/32 CANInsertWithFailure-PT-040-LTLFireability-12 720251 m, 4622 m/sec, 2053410 t fired, .

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 160/3509 16/32 CANInsertWithFailure-PT-040-LTLFireability-12 742838 m, 4517 m/sec, 2119713 t fired, .

Time elapsed: 251 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 165/3509 17/32 CANInsertWithFailure-PT-040-LTLFireability-12 766413 m, 4715 m/sec, 2187109 t fired, .

Time elapsed: 256 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 170/3509 17/32 CANInsertWithFailure-PT-040-LTLFireability-12 789212 m, 4559 m/sec, 2253532 t fired, .

Time elapsed: 261 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 175/3509 18/32 CANInsertWithFailure-PT-040-LTLFireability-12 812674 m, 4692 m/sec, 2321648 t fired, .

Time elapsed: 266 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 180/3509 18/32 CANInsertWithFailure-PT-040-LTLFireability-12 839786 m, 5422 m/sec, 2399028 t fired, .

Time elapsed: 271 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 185/3509 19/32 CANInsertWithFailure-PT-040-LTLFireability-12 868090 m, 5660 m/sec, 2480402 t fired, .

Time elapsed: 276 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 190/3509 19/32 CANInsertWithFailure-PT-040-LTLFireability-12 897631 m, 5908 m/sec, 2565599 t fired, .

Time elapsed: 281 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 195/3509 20/32 CANInsertWithFailure-PT-040-LTLFireability-12 926817 m, 5837 m/sec, 2649560 t fired, .

Time elapsed: 286 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 200/3509 20/32 CANInsertWithFailure-PT-040-LTLFireability-12 953929 m, 5422 m/sec, 2727896 t fired, .

Time elapsed: 291 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 205/3509 21/32 CANInsertWithFailure-PT-040-LTLFireability-12 979688 m, 5151 m/sec, 2802496 t fired, .

Time elapsed: 296 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 210/3509 21/32 CANInsertWithFailure-PT-040-LTLFireability-12 1005970 m, 5256 m/sec, 2878250 t fired, .

Time elapsed: 301 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 215/3509 22/32 CANInsertWithFailure-PT-040-LTLFireability-12 1031097 m, 5025 m/sec, 2951733 t fired, .

Time elapsed: 306 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 220/3509 22/32 CANInsertWithFailure-PT-040-LTLFireability-12 1059746 m, 5729 m/sec, 3034972 t fired, .

Time elapsed: 311 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 225/3509 23/32 CANInsertWithFailure-PT-040-LTLFireability-12 1088176 m, 5686 m/sec, 3117198 t fired, .

Time elapsed: 316 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 230/3509 23/32 CANInsertWithFailure-PT-040-LTLFireability-12 1115397 m, 5444 m/sec, 3195957 t fired, .

Time elapsed: 321 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 235/3509 24/32 CANInsertWithFailure-PT-040-LTLFireability-12 1144206 m, 5761 m/sec, 3279198 t fired, .

Time elapsed: 326 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 240/3509 24/32 CANInsertWithFailure-PT-040-LTLFireability-12 1172659 m, 5690 m/sec, 3362383 t fired, .

Time elapsed: 331 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 245/3509 25/32 CANInsertWithFailure-PT-040-LTLFireability-12 1199662 m, 5400 m/sec, 3440177 t fired, .

Time elapsed: 336 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 250/3509 25/32 CANInsertWithFailure-PT-040-LTLFireability-12 1228638 m, 5795 m/sec, 3524664 t fired, .

Time elapsed: 341 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 255/3509 26/32 CANInsertWithFailure-PT-040-LTLFireability-12 1258744 m, 6021 m/sec, 3612153 t fired, .

Time elapsed: 346 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 260/3509 26/32 CANInsertWithFailure-PT-040-LTLFireability-12 1287890 m, 5829 m/sec, 3696611 t fired, .

Time elapsed: 351 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 265/3509 27/32 CANInsertWithFailure-PT-040-LTLFireability-12 1317256 m, 5873 m/sec, 3781714 t fired, .

Time elapsed: 356 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 270/3509 28/32 CANInsertWithFailure-PT-040-LTLFireability-12 1348232 m, 6195 m/sec, 3870838 t fired, .

Time elapsed: 361 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 275/3509 28/32 CANInsertWithFailure-PT-040-LTLFireability-12 1377456 m, 5844 m/sec, 3956178 t fired, .

Time elapsed: 366 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 280/3509 29/32 CANInsertWithFailure-PT-040-LTLFireability-12 1406585 m, 5825 m/sec, 4041274 t fired, .

Time elapsed: 371 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 285/3509 29/32 CANInsertWithFailure-PT-040-LTLFireability-12 1438904 m, 6463 m/sec, 4134175 t fired, .

Time elapsed: 376 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 290/3509 30/32 CANInsertWithFailure-PT-040-LTLFireability-12 1468803 m, 5979 m/sec, 4220858 t fired, .

Time elapsed: 381 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 295/3509 30/32 CANInsertWithFailure-PT-040-LTLFireability-12 1499477 m, 6134 m/sec, 4310362 t fired, .

Time elapsed: 386 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 300/3509 31/32 CANInsertWithFailure-PT-040-LTLFireability-12 1531150 m, 6334 m/sec, 4402574 t fired, .

Time elapsed: 391 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 305/3509 31/32 CANInsertWithFailure-PT-040-LTLFireability-12 1560052 m, 5780 m/sec, 4486709 t fired, .

Time elapsed: 396 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 310/3509 32/32 CANInsertWithFailure-PT-040-LTLFireability-12 1582778 m, 4545 m/sec, 4549098 t fired, .

Time elapsed: 401 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CANInsertWithFailure-PT-040-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-040-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-040-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 406 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-040-LTLFireability-03: LTL unknown AGGR
CANInsertWithFailure-PT-040-LTLFireability-12: LTL unknown AGGR


Time elapsed: 406 secs. Pages in use: 32

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="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-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 r039-tajo-167813692900732"
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 ;