Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838852500083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Echo-PT-d03r03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852500083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678437437021

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 08:37:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 08:37:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:37:18] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-10 08:37:18] [INFO ] Transformed 265 places.
[2023-03-10 08:37:18] [INFO ] Transformed 206 transitions.
[2023-03-10 08:37:18] [INFO ] Found NUPN structural information;
[2023-03-10 08:37:18] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 244 transition count 206
Applied a total of 21 rules in 24 ms. Remains 244 /265 variables (removed 21) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 244 cols
[2023-03-10 08:37:18] [INFO ] Computed 114 place invariants in 41 ms
[2023-03-10 08:37:19] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-10 08:37:19] [INFO ] Invariant cache hit.
[2023-03-10 08:37:19] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
[2023-03-10 08:37:19] [INFO ] Invariant cache hit.
[2023-03-10 08:37:20] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/265 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1605 ms. Remains : 244/265 places, 206/206 transitions.
Support contains 33 out of 244 places after structural reductions.
[2023-03-10 08:37:20] [INFO ] Flatten gal took : 62 ms
[2023-03-10 08:37:20] [INFO ] Flatten gal took : 38 ms
[2023-03-10 08:37:20] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 31 out of 244 places (down from 33) after GAL structural reductions.
Finished random walk after 843 steps, including 15 resets, run visited all 19 properties in 194 ms. (steps per millisecond=4 )
FORMULA Echo-PT-d03r03-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Echo-PT-d03r03-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 244 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 244 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(G(p0))||G(p1))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 11 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 08:37:21] [INFO ] Computed 108 place invariants in 22 ms
[2023-03-10 08:37:21] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-10 08:37:21] [INFO ] Invariant cache hit.
[2023-03-10 08:37:22] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2023-03-10 08:37:22] [INFO ] Invariant cache hit.
[2023-03-10 08:37:22] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s129 0) (EQ s195 1)), p1:(AND (EQ s195 0) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-00 finished in 1741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X(p1))) U p2))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 206
Applied a total of 4 rules in 14 ms. Remains 240 /244 variables (removed 4) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 240 cols
[2023-03-10 08:37:22] [INFO ] Computed 110 place invariants in 28 ms
[2023-03-10 08:37:23] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-10 08:37:23] [INFO ] Invariant cache hit.
[2023-03-10 08:37:23] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-03-10 08:37:23] [INFO ] Invariant cache hit.
[2023-03-10 08:37:24] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1259 ms. Remains : 240/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s55 1), p0:(OR (EQ s160 0) (EQ s0 1)), p1:(OR (EQ s237 0) (EQ s14 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 1 reset in 8 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-07 finished in 1459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 10 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 08:37:24] [INFO ] Computed 108 place invariants in 20 ms
[2023-03-10 08:37:24] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-10 08:37:24] [INFO ] Invariant cache hit.
[2023-03-10 08:37:25] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-10 08:37:25] [INFO ] Invariant cache hit.
[2023-03-10 08:37:25] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1441 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-08 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s24 0) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 369 ms.
Product exploration explored 100000 steps with 25000 reset in 302 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-10 08:37:27] [INFO ] Invariant cache hit.
[2023-03-10 08:37:27] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-10 08:37:27] [INFO ] Invariant cache hit.
[2023-03-10 08:37:28] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-10 08:37:28] [INFO ] Invariant cache hit.
[2023-03-10 08:37:28] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1292 ms. Remains : 238/238 places, 206/206 transitions.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 265 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 36 ms. Remains 231 /238 variables (removed 7) and now considering 205/206 (removed 1) transitions.
[2023-03-10 08:37:30] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 205 rows 231 cols
[2023-03-10 08:37:30] [INFO ] Computed 102 place invariants in 14 ms
[2023-03-10 08:37:30] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/238 places, 205/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 231/238 places, 205/206 transitions.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 08:37:30] [INFO ] Computed 108 place invariants in 17 ms
[2023-03-10 08:37:31] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-10 08:37:31] [INFO ] Invariant cache hit.
[2023-03-10 08:37:31] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-10 08:37:31] [INFO ] Invariant cache hit.
[2023-03-10 08:37:32] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1413 ms. Remains : 238/238 places, 206/206 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-08 finished in 8123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)&&X(F(p2)))||p0)))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 240 transition count 206
Applied a total of 4 rules in 7 ms. Remains 240 /244 variables (removed 4) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 240 cols
[2023-03-10 08:37:32] [INFO ] Computed 110 place invariants in 14 ms
[2023-03-10 08:37:32] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-10 08:37:32] [INFO ] Invariant cache hit.
[2023-03-10 08:37:33] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2023-03-10 08:37:33] [INFO ] Invariant cache hit.
[2023-03-10 08:37:33] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 240/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s168 0), p0:(OR (EQ s189 0) (EQ s114 1)), p2:(OR (EQ s154 0) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Computed a total of 240 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
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 152 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLCardinality-09 finished in 2119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X((X(p1) U p1))&&p0)))))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 238 transition count 206
Applied a total of 6 rules in 7 ms. Remains 238 /244 variables (removed 6) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2023-03-10 08:37:34] [INFO ] Computed 108 place invariants in 19 ms
[2023-03-10 08:37:35] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-10 08:37:35] [INFO ] Invariant cache hit.
[2023-03-10 08:37:35] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2023-03-10 08:37:35] [INFO ] Invariant cache hit.
[2023-03-10 08:37:35] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1321 ms. Remains : 238/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s229 0) (EQ s68 1)) (OR (EQ s138 0) (EQ s218 1))), p1:(OR (EQ s138 0) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3889 reset in 465 ms.
Product exploration explored 100000 steps with 3925 reset in 519 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false]
Incomplete random walk after 10000 steps, including 181 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 08:37:37] [INFO ] Invariant cache hit.
[2023-03-10 08:37:37] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 415 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
[2023-03-10 08:37:38] [INFO ] Invariant cache hit.
[2023-03-10 08:37:39] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 1375 ms returned sat
[2023-03-10 08:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:37:41] [INFO ] [Real]Absence check using state equation in 1512 ms returned sat
[2023-03-10 08:37:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:37:42] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 1028 ms returned sat
[2023-03-10 08:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:37:43] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2023-03-10 08:37:43] [INFO ] Computed and/alt/rep : 126/606/126 causal constraints (skipped 79 transitions) in 18 ms.
[2023-03-10 08:37:44] [INFO ] Added : 64 causal constraints over 16 iterations in 933 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-10 08:37:44] [INFO ] Invariant cache hit.
[2023-03-10 08:37:45] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-10 08:37:45] [INFO ] Invariant cache hit.
[2023-03-10 08:37:45] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-10 08:37:45] [INFO ] Invariant cache hit.
[2023-03-10 08:37:46] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1354 ms. Remains : 238/238 places, 206/206 transitions.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Finished random walk after 26 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
[2023-03-10 08:37:47] [INFO ] Invariant cache hit.
[2023-03-10 08:37:48] [INFO ] [Real]Absence check using 0 positive and 108 generalized place invariants in 1376 ms returned sat
[2023-03-10 08:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:37:50] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2023-03-10 08:37:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:37:51] [INFO ] [Nat]Absence check using 0 positive and 108 generalized place invariants in 1023 ms returned sat
[2023-03-10 08:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:37:52] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2023-03-10 08:37:52] [INFO ] Computed and/alt/rep : 126/606/126 causal constraints (skipped 79 transitions) in 16 ms.
[2023-03-10 08:37:53] [INFO ] Added : 64 causal constraints over 16 iterations in 907 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), false, false]
Product exploration explored 100000 steps with 3679 reset in 544 ms.
Product exploration explored 100000 steps with 3721 reset in 520 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2023-03-10 08:37:55] [INFO ] Computed 108 place invariants in 19 ms
[2023-03-10 08:37:55] [INFO ] Implicit Places using invariants in 391 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 399 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 419 ms. Remains : 230/238 places, 205/206 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-10 finished in 21007 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(((F(p0)||(p1 U p2))&&(F(p0)||G(p1))))))'
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 231 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 10 ms. Remains 230 /244 variables (removed 14) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-10 08:37:55] [INFO ] Computed 102 place invariants in 18 ms
[2023-03-10 08:37:55] [INFO ] Implicit Places using invariants in 402 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 405 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/244 places, 204/206 transitions.
Applied a total of 0 rules in 14 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 224/244 places, 204/206 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s125 1), p1:(OR (EQ s39 0) (EQ s184 1)), p2:(OR (EQ s189 0) (EQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2036 reset in 425 ms.
Product exploration explored 100000 steps with 2039 reset in 442 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 507 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 113 steps, including 2 resets, run visited all 4 properties in 4 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 10 factoid took 626 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 14 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2023-03-10 08:37:58] [INFO ] Computed 96 place invariants in 17 ms
[2023-03-10 08:37:59] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-10 08:37:59] [INFO ] Invariant cache hit.
[2023-03-10 08:37:59] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2023-03-10 08:37:59] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 08:37:59] [INFO ] Invariant cache hit.
[2023-03-10 08:37:59] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1044 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 10 factoid took 603 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2052 reset in 389 ms.
Product exploration explored 100000 steps with 2046 reset in 402 ms.
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 8 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 08:38:02] [INFO ] Invariant cache hit.
[2023-03-10 08:38:02] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-10 08:38:02] [INFO ] Invariant cache hit.
[2023-03-10 08:38:03] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-10 08:38:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 08:38:03] [INFO ] Invariant cache hit.
[2023-03-10 08:38:03] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-11 finished in 8005 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 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 232 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 12 ms. Remains 231 /244 variables (removed 13) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 231 cols
[2023-03-10 08:38:03] [INFO ] Computed 103 place invariants in 11 ms
[2023-03-10 08:38:03] [INFO ] Implicit Places using invariants in 386 ms returned [16, 182, 204, 212, 217, 225]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 388 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/244 places, 204/206 transitions.
Applied a total of 0 rules in 12 ms. Remains 225 /225 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 225/244 places, 204/206 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-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:(NEQ s39 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 52 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-12 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 239 transition count 206
Applied a total of 5 rules in 2 ms. Remains 239 /244 variables (removed 5) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 239 cols
[2023-03-10 08:38:03] [INFO ] Computed 109 place invariants in 18 ms
[2023-03-10 08:38:04] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-10 08:38:04] [INFO ] Invariant cache hit.
[2023-03-10 08:38:04] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
[2023-03-10 08:38:04] [INFO ] Invariant cache hit.
[2023-03-10 08:38:05] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/244 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 239/244 places, 206/206 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s149 0) (EQ s7 1) (EQ s90 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLCardinality-15 finished in 1354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : Echo-PT-d03r03-LTLCardinality-08
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 places, 206/206 transitions.
Graph (complete) has 773 edges and 244 vertex of which 231 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 10 ms. Remains 230 /244 variables (removed 14) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2023-03-10 08:38:05] [INFO ] Computed 102 place invariants in 21 ms
[2023-03-10 08:38:05] [INFO ] Implicit Places using invariants in 372 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 374 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 224/244 places, 204/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 395 ms. Remains : 224/244 places, 204/206 transitions.
Running random walk in product with property : Echo-PT-d03r03-LTLCardinality-08 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s23 0) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24228 reset in 262 ms.
Product exploration explored 100000 steps with 24196 reset in 282 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 224 cols
[2023-03-10 08:38:07] [INFO ] Computed 96 place invariants in 14 ms
[2023-03-10 08:38:07] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-10 08:38:07] [INFO ] Invariant cache hit.
[2023-03-10 08:38:08] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-10 08:38:08] [INFO ] Invariant cache hit.
[2023-03-10 08:38:08] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 224/224 places, 204/204 transitions.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24112 reset in 272 ms.
Product exploration explored 100000 steps with 23971 reset in 288 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 08:38:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 08:38:10] [INFO ] Invariant cache hit.
[2023-03-10 08:38:10] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 224/224 places, 204/204 transitions.
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2023-03-10 08:38:10] [INFO ] Invariant cache hit.
[2023-03-10 08:38:10] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-10 08:38:10] [INFO ] Invariant cache hit.
[2023-03-10 08:38:10] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-10 08:38:11] [INFO ] Invariant cache hit.
[2023-03-10 08:38:11] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 969 ms. Remains : 224/224 places, 204/204 transitions.
Treatment of property Echo-PT-d03r03-LTLCardinality-08 finished in 5921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X((X(p1) U p1))&&p0)))))'
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(((F(p0)||(p1 U p2))&&(F(p0)||G(p1))))))'
[2023-03-10 08:38:11] [INFO ] Flatten gal took : 29 ms
[2023-03-10 08:38:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 08:38:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 206 transitions and 1172 arcs took 3 ms.
Total runtime 53005 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Echo-PT-d03r03
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA Echo-PT-d03r03-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678437547901

--------------------
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 LTLCardinality -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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Echo-PT-d03r03-LTLCardinality-10
lola: time limit : 1200 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
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1200 6/32 Echo-PT-d03r03-LTLCardinality-10 881043 m, 176208 m/sec, 3929473 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1200 11/32 Echo-PT-d03r03-LTLCardinality-10 1674568 m, 158705 m/sec, 7871435 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1200 17/32 Echo-PT-d03r03-LTLCardinality-10 2465339 m, 158154 m/sec, 11765902 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1200 22/32 Echo-PT-d03r03-LTLCardinality-10 3272452 m, 161422 m/sec, 15638690 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1200 27/32 Echo-PT-d03r03-LTLCardinality-10 4008618 m, 147233 m/sec, 19491770 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1200 32/32 Echo-PT-d03r03-LTLCardinality-10 4771361 m, 152548 m/sec, 23343226 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for Echo-PT-d03r03-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-08: LTL 0 1 0 0 1 0 0 0
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 Echo-PT-d03r03-LTLCardinality-08
lola: time limit : 1782 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Echo-PT-d03r03-LTLCardinality-08
lola: result : true
lola: markings : 47
lola: fired transitions : 61
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 Echo-PT-d03r03-LTLCardinality-11
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r03-LTLCardinality-08: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3565 9/32 Echo-PT-d03r03-LTLCardinality-11 1300935 m, 260187 m/sec, 3005845 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r03-LTLCardinality-08: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3565 18/32 Echo-PT-d03r03-LTLCardinality-11 2619271 m, 263667 m/sec, 5955709 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r03-LTLCardinality-08: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3565 26/32 Echo-PT-d03r03-LTLCardinality-11 3951600 m, 266465 m/sec, 8908175 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for Echo-PT-d03r03-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r03-LTLCardinality-08: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Echo-PT-d03r03-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Echo-PT-d03r03-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Echo-PT-d03r03-LTLCardinality-08: LTL true LTL model checker
Echo-PT-d03r03-LTLCardinality-10: LTL unknown AGGR
Echo-PT-d03r03-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 55 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="Echo-PT-d03r03"
export BK_EXAMINATION="LTLCardinality"
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 Echo-PT-d03r03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838852500083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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